LSM Tree: Log-Structured Merge Tree
B-trees have dominated database indexing for decades, but they carry a fundamental limitation: random I/O on writes. Every insert or update potentially requires reading a page, modifying it, and…
Read more →Lsm
Compaction: LSM Tree Maintenance
LSM trees trade immediate write costs for deferred maintenance. Every write goes to an in-memory buffer, which periodically flushes to disk as an immutable SSTable. This design gives you excellent…
Read more →