{
  "slug": "lazy-leveling",
  "term": "Lazy leveling",
  "definition": "Lazy leveling combines tiering at smaller LSM-tree levels with leveling at the largest level.",
  "note": "Dayan and Idreos introduce this policy in Dostoevsky. Its point-lookup analysis co-optimizes Bloom-filter allocation; short range lookups retain a larger startup cost. It still performs merges when data moves down the tree. [dostoevsky]",
  "related": [
    "fluid-lsm-tree",
    "leveled-compaction",
    "tiered-compaction",
    "sorted-run",
    "bloom-filter"
  ],
  "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"
    }
  ],
  "aliases": [],
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-10"
}