4 ms·

For set membership checks, bloom filters are way more memory efficient. And almost accurate. Lots of bloom filters of different sizes holding the same data can

by chatman 13y ago

For set membership checks, bloom filters are way more memory efficient. And almost accurate. Lots of bloom filters of different sizes holding the same data can bring down the false positives to negligible.

GhotiFish 13y ago
Is having bloom filters of sizes 1024, 2048, and 4096 more dependable than one bloom filter of 8192? That is surprising to me.
- leif 13y ago
  It's a similar strategy to having one bloom filter with many hash functions, but the math is a little different. Nearly the same effect though.