Data structureadvanced
Log-structured merge tree
Also called LSM tree.
Buffers writes in memory and merges sorted runs on disk, trading read cost for high write throughput.
Buffers writes in memory and merges sorted runs on disk, trading read cost for high write throughput.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag T0A3TV Edit this page History Report an error