To quote Wikipedia: A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. This is often used by systems in order to avoid accessing slow media, like a disk. Take HBase or Cassandra for instance: Instead of reading their data files in… Continue reading Space efficient Bloom filter index, 2x performance gain
Tag: Hashing
Hashing passwords
If there’s one thing that really annoy me, it’s when I forget my password at some random website, ask for a password reminder and get my old password sent back to me in clear text in an email. This shows so many levels of ignorance in the people that developed the system, that I immediately feel like… Continue reading Hashing passwords