Definition
A write-optimized storage structure: buffer in memory, flush sorted files, compact.
How it works
Turns random writes into sequential appends (fast writes) at the cost of read amplification + compaction. Used by Cassandra, RocksDB.
Common questions
What is LSM-Tree?
A write-optimized storage structure: buffer in memory, flush sorted files, compact.
How does LSM-Tree work?
Turns random writes into sequential appends (fast writes) at the cost of read amplification + compaction. Used by Cassandra, RocksDB.
What is LSM-Tree used for in system design?
Turns random writes into sequential appends (fast writes) at the cost of read amplification + compaction. Used by Cassandra, RocksDB.
Part of Glossary on SystemLore — system design explained with 148 deep topics, interactive diagrams, and a build-it-yourself game. Build this one →