{
  "slug": "fluid-lsm-tree",
  "term": "Fluid LSM-tree",
  "definition": "Fluid LSM-tree parameterizes the run-count limit separately for smaller levels and the largest level.",
  "note": "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. [dostoevsky] Hesela's run-count example is structural arithmetic, not a latency predictor. [hesela]",
  "related": [
    "lazy-leveling",
    "leveled-compaction",
    "tiered-compaction",
    "sorted-run"
  ],
  "citations": [
    {
      "id": "dostoevsky",
      "title": "Dayan and Idreos. Dostoevsky. SIGMOD 2018, pp. 505-520; sections 4.1-4.3 and Figure 8. DOI: 10.1145/3183713.3196927.",
      "url": "https://nivdayan.github.io/dostoevsky.pdf",
      "accessed": "2026-11-10"
    },
    {
      "id": "hesela",
      "title": "Hesela. Lazy leveling and run-count limits.",
      "url": "https://hesela.com/analyses/bloom-filters-lsm-read-cost/#lazy-leveling",
      "accessed": "2026-11-10"
    }
  ],
  "aliases": [],
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-10"
}