Part 03 · Indexing
Bloom Filters
Bloom filterFalse positiveBits per key
How an LSM engine skips SSTables that cannot hold a key: a bit array that says 'maybe' or 'definitely not', and how to size it for a target false positive rate.
⏱ 6 min · Station 21 of 123