fluid-lsm-tree · research

Fluid LSM-tree

Fluid LSM-tree parameterizes the run-count limit separately for smaller levels and the largest level.

The paper uses K for the smaller-level cap and Z for the last-level cap, each from 1 to T - 1 for size ratio T. Z need not equal one. [1] Hesela's run-count example is structural arithmetic, not a latency predictor. [2]

Relations

related
Lazy leveling, Leveled compaction, Tiered compaction, Sorted run

Citations

  1. Dayan and Idreos. Dostoevsky. SIGMOD 2018, pp. 505-520; sections 4.1-4.3 and Figure 8. DOI: 10.1145/3183713.3196927. (accessed 2026-11-10)
  2. Hesela. Lazy leveling and run-count limits. (accessed 2026-11-10)

JSON: /data/terms/fluid-lsm-tree.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Fluid LSM-tree. Hesela. 2026-11-10. https://hesela.dev/terms/fluid-lsm-tree/