✳flâneur — a map of the web's best reading

Bloom Filters - Much, much more than a space efficient hashmap! | Ben E. C. Boyter

boyter.org · 2,581 words · saved by 2 readers

A bloom filter is one of those data structures you are probably already aware of, or have at least heard about. For those looking for a simple recap, they are a probabilistic data structure which can be used to determine if something is in a set or not, giving a slight chance of returning a false positive result for some checks but while using less space than a full hashmap. What you may not know is that while you can use them as a space efficient hash/dictionary there are other use cases you might not be aware of. However before going though usage though, lets take a quick moment to build one. A lot of people seem to lack this understanding and assume that bloom filters are more complex or mysterious than they actually are. Turns out a bloom filter is actually really easy to build if you don’t mind doing it inefficiently (at least at first). I am going to implement one using JavaScript because anyone reading this can follow along using the browser console. Why? Well I find a simple bi

Bloom Filters - Much, much more than a space efficient hashmap! | Ben E. C. Boyter Bloom Filters - Much, much more than a space efficient hashmap! 2020/12/10 (2440 words) A bloom filter is one of those data structures you are probably already aware of, or have at least heard about. For those looking for a simple recap, they are a probabilistic data structure which can be used to determine if something is in a set or not, giving a slight chance of returning a false positive result for some checks but while using less space than a full hashmap. What you may not know is that while you can use the

Explore this link on the map →

saved by

related reading