Open techzhou opened 5 years ago
For example,
new FilterBuilder(1000000, 1e-5)
when it full (added 1000000 elements)
how much memory it cost. is there any calculation method?
N (added elements , 1000000 eg.) f (falseProbability, 1e-5 eg.) M (total bit): M = - N ln(f) / ln2^2. K(hash functions): K = max(1, ln2 M/N)
For example,
when it full (added 1000000 elements)
how much memory it cost. is there any calculation method?