I think we are talking past each other here. What I was missing was the
size of the filter. I was assuming that the size of the filter was the
number of bits specified in the BloomFilterCalculations (error on my
part), what I was missing was the multiplication of the number of bits by
the number
I’m not sure I follow your reasoning. The bloom filter table is false positive
per sstable given the number of bits *per key*. So for 10 keys you would have
200 bits, which yields the same false positive rate as 20 bits and 1 key.
It does taper slightly at much larger N, but it’s pretty nominal
Can someone explain to me how the Bloom filter table in
BloomFilterCalculations was derived and how it is supposed to work? As I
read the table it seems to indicate that with 14 hashes and 20 bits you get
a fp of 6.71e-05. But if you plug those numbers into the Bloom filter
calculator [1], that
