Calculate the required bloom filter size and optimal number of hashes from the expected number of items in the collection and acceptable false-positive rate.
You can also see the breakdown of how the bloom filter size and optimal number of hashes are calculated...
Expected number of items in the collection (n)..
Acceptable false-positive rate (fpr). 0.01 = 1%..
Optimal size (number of elements in the bit array)..
Optimal number of hash functionsBloom Filter is a space-efficient probabilistic data structure which is used to test whether an element is a member of a set or not. We may get false positive matches, but false negatives are not.
Comments 2
Partho Sarathi
Changing k should alter m
Partho Sarathi
Can you list the formulas?