The Log-Structured Merge-Tree (LSM-Tree).¶
O’Neil, E., Cheng, E., Gawlick, D., & O’Neil, E. (1996). The Log-Structured Merge-Tree (LSM-Tree). Acta Informatica, 33(4), 351-385.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Two-Store Architecture
- Databases pair a write-ahead log and in-memory tables with on-disk B-tree or LSM storage, using compaction and checkpointing as transfer windows.
This sourceDefines the LSM-tree — in-memory memtable plus write-ahead log feeding on-disk sorted runs via compaction.
- Databases pair a write-ahead log and in-memory tables with on-disk B-tree or LSM storage, using compaction and checkpointing as transfer windows.
Mechanisms¶
- Commit Log and Compaction Cycle
- Its signature failure mode is write amplification: the same logical datum is physically rewritten several times as it is repeatedly compacted, so a workload that looks light on paper can saturate disk bandwidth with background merges.
This sourceDescribes entries migrating through successive LSM-tree components by repeated asynchronous rolling merges.
- Its signature failure mode is write amplification: the same logical datum is physically rewritten several times as it is repeatedly compacted, so a workload that looks light on paper can saturate disk bandwidth with background merges.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:d6bcc06f7390 · see in the full table