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.

Type

Journal article

Intellectual base

Primary research

Year

1996

DOI

10.1007/s002360050048

Link

https://doi.org/10.1007/s002360050048

Cited from

systems_cybernetics

Cited by

1 citation across 1 artifact.

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.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:d6bcc06f7390 · see in the full table