“This looks really promising! A Bloom Filter that represents a set of million items with a false-positive rate of 0.01 requires only 9585059 bits and 7 hash functions.“
My immediate thought here was that this wasn't very space efficient as it requires over 9 bits per item?
I'd have to dig more into this though to confirm or deny my intuition!
My immediate thought here was that this wasn't very space efficient as it requires over 9 bits per item?
I'd have to dig more into this though to confirm or deny my intuition!
Edit: this page agrees with the blog post and shows some interesting graphs https://hur.st/bloomfilter/?n=1000000&p=0.01&m=&k=