Bloom filters have a predictable false positive rate (FPP):
- n is the number of elements that have been added;
- k the number of hashes;
- m The length of the Bloom filter (such as the size of the bit array);
The range of n/m is [0,1),
When the left end point is taken, FPP=0;
When (n/m) tends to 1 (but always less than 1), the image of (1-e^(-k))^k is drawn, and it can be concluded that the misjudgment rate is very close to 1, but less than 1, indicating When using bloom filters, try to ensure that n<<m (this is my own guess, if there are errors, please point out)
