🔎 Under the Hood: Flushing an LSM Tree
Deep dive into MemTables, flushing to SSTables, and why compaction is where the real costs lie. Includes the full lifecycle of a key, with cost analysis for insert, flush, and compaction steps.
2 docs tagged with "Bloom Filters"
View all tagsThe Deterministic Property of Hashing: Why O(1) Lookups (and Bloom Filters) Work at All
Hash maps aren’t fast because of magic or randomness — they’re fast because hashing is deterministic. Learn why this property powers O(1) lookups, Bloom filters, and consistent hashing.