LSM-Trees and B-Trees: The Best of Both Worlds

Summary: Online transition between LSM-Trees and B-Trees in a KV store to adapt to changing workloads. Runtime switching combines update-efficient LSM behavior with fast short-range lookups, delivering the best of both worlds for diverse data-management workloads. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 5628
Venue: SIGMOD
Year: 2019
Pagerank: 4.7568442e-05
Overall Rank: 7,343 | 48.92%
DOI: 10.1145/3299869.3300097

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,227	Cosine: A Cloud-Cost Optimized Self-Designing Key-Value Storage Engine	2022	VLDB	6.3434324e-05
9,799	CloudJump: Optimizing Cloud Databases for Cloud Storages	2022	VLDB	4.2818172e-05
10,934	Native Cloud Object Storage in Db2 Warehouse: Implementing a Fast and Cost-Efficient Cloud Storage Architecture	2024	SIGMOD	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
609	Monkey: Optimal Navigable Key-Value Store	2017	SIGMOD	0.0001923446
1,311	Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging	2018	SIGMOD	0.00012657439
2,157	The Data Calculator*: Data Structure Design and Cost Synthesis from First Principles and Learned Cost Models	2018	SIGMOD	9.416022e-05
2,606	Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn	2019	CIDR	8.4645832e-05
5,119	Design Tradeoffs of Data Access Methods	2016	SIGMOD	5.6807904e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
8,339	How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice	2025	SIGMOD	4.5434069e-05
2,109	The Log-Structured Merge-Bush & the Wacky Continuum	2019	SIGMOD	9.5318694e-05
7,743	Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems	2019	VLDB	4.6626575e-05
7,620	Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads	2023	SIGMOD	4.693568e-05
5,791	Dissecting, Designing, and Optimizing LSM-based Data Stores	2022	SIGMOD	5.3268999e-05
7,218	Breaking Down Memory Walls in LSM-based Storage Systems	2020	SIGMOD	4.7982543e-05
2,606	Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn	2019	CIDR	8.4645832e-05
10,368	B-Trees Are Back: Engineering Fast and Pageable Node Layouts	2025	SIGMOD	4.1945683e-05
9,071	Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space	2024	SIGMOD	4.4025274e-05
11,704	Splaying Log-Structured Merge-Trees	2018	SIGMOD	4.1945683e-05