How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice

Summary: Vertiorizon adaptively blends vertical and horizontal LSM-tree growth to balance lookups, updates, and space. It generalizes Bentley–Saxe’s theory to optimize read-write costs, outperforming pure vertical designs and greatly reducing space compared with horizontal; RocksDB integration shows improved writes with ~6× less extra space. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h4b09a0f019194a23
Venue: SIGMOD
Year: 2025
Pagerank: 5.3536854e-05
Overall Rank: 8,329 | 44.01%
DOI: 10.1145/3725310

Incoming Non-self Citations Over Time

Authors

1. Dingheng Mo (Nanyang Technological University)
2. Siqiang Luo (Nanyang Technological University)
3. Stratos Idreos (Harvard University)

BibTeX Citation

@inproceedings{mo_sigmod25,
        title = {{How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice}},
        author = {Mo, Dingheng and Luo, Siqiang and Idreos, Stratos},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3725310},
        url = {https://dl.acm.org/doi/10.1145/3725310},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,221	ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic Workloads	2026	VLDB	5.3759492e-05
9,643	Hourglass: An Adaptive Range Filter with Lightweight Hybrid Encoding	2026	SIGMOD	5.1453267e-05
11,063	Terark-DS: A High-Performance and Storage-Efficient Key-Value Separation Storage Engine on Disaggregated Storage	2026	VLDB	4.9793485e-05
11,342	DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees	2025	VLDB	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 24 of 24 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
258	bLSM: A General Purpose Log Structured Merge Tree	2012	SIGMOD	0.00022939599
400	Monkey: Optimal Navigable Key-Value Store	2017	SIGMOD	0.00019129175
754	Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging	2018	SIGMOD	0.00014236015
816	SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data	2017	VLDB	0.00013687311
891	SuRF: Practical Range Query Filtering with Fast Succinct Tries	2018	SIGMOD	0.00013245926
922	AsterixDB: A Scalable, Open Source BDMS	2014	VLDB	0.00013068048
1,313	X-Engine: An Optimized Storage Engine for Large-scale E-commerce Transaction Processing	2019	SIGMOD	0.00011060108
1,422	The Log-Structured Merge-Bush & the Wacky Continuum	2019	SIGMOD	0.00010725538
1,569	Compaction management in distributed key-value datastores	2015	VLDB	0.00010211433
1,889	Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn	2019	CIDR	9.4273689e-05
1,980	Chucky: A Succinct Cuckoo Filter for LSM-Tree	2021	SIGMOD	9.2595896e-05
2,664	Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores	2020	SIGMOD	8.1569551e-05
2,788	Lethe: A Tunable Delete-Aware LSM Engine	2020	SIGMOD	8.0133966e-05
2,868	Spooky: Granulating LSM-Tree Compactions Correctly	2022	VLDB	7.9241972e-05
2,995	Accordion: Better Memory Organization for LSM Key-Value Stores	2018	VLDB	7.7705434e-05
3,232	TreeLine: An Update-In-Place Key-Value Store for Modern Storage	2023	VLDB	7.50343e-05
3,479	Cosine: A Cloud-Cost Optimized Self-Designing Key-Value Storage Engine	2022	VLDB	7.2695068e-05
3,671	Leaper: A Learned Prefetcher for Cache Invalidation in LSM-tree based Storage Engines	2020	VLDB	7.1100217e-05
4,197	Proteus: A Self-Designing Range Filter	2022	SIGMOD	6.7417716e-05
4,750	GRF: A Global Range Filter for LSM-Trees with Shape Encoding	2024	SIGMOD	6.4354422e-05
5,018	Breaking Down Memory Walls: Adaptive Memory Management in LSM-based Storage Systems	2021	VLDB	6.3121723e-05
5,044	Lightweight Cardinality Estimation in LSM-based Systems	2018	SIGMOD	6.30014e-05
5,248	Endure: A Robust Tuning Paradigm for LSM Trees Under Workload Uncertainty	2022	VLDB	6.211056e-05
9,181	Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space	2024	SIGMOD	5.2118872e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,770	Constructing and Analyzing the LSM Compaction Design Space	2021	VLDB
2	9,181	Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space	2024	SIGMOD
3	816	SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data	2017	VLDB
4	9,130	Rethinking The Compaction Policies in LSM-trees	2025	SIGMOD
5	7,594	Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems	2019	VLDB
6	6,635	LSM-Trees and B-Trees: The Best of Both Worlds	2019	SIGMOD
7	12,208	Splaying Log-Structured Merge-Trees	2018	SIGMOD
8	9,646	Are Joins over LSM-trees Ready? Take RocksDB as an Example	2025	VLDB
9	5,046	Dissecting, Designing, and Optimizing LSM-based Data Stores	2022	SIGMOD
10	6,932	Breaking Down Memory Walls in LSM-based Storage Systems	2020	SIGMOD