Two Bits Are Better Than One: making bloom filters 2x more accurate
Summary
Two Bits Are Better Than One explains a Bloom filter optimization that doubles accuracy with minimal cost, using two bits in a 32-bit word. It covers adaptive filtering in the storage engine, hash-join Bloom filters, and concrete benchmarks showing major reductions in data decompression and I/O. The piece combines math, code-level discussion, and practical takeaways for engineers building high-performance data systems.