{"id":"lsm-two-merge-strategies","text":"Compaction uses `heapq`-based k-way merge with `prev_key` deduplication (lsm.py ~line 323), while `range_scan` uses a dict-based materialize-everything approach (lines 275–298) — two fundamentally different merge strategies in the same codebase","truth_value":"IN","source":"entries/2026/05/29/topic-leveldb-merging-iterator.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"lsm-two-merge-strategies","truth_value":"IN","reason":"premise"}]}}