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)
Incoming Non-self Citations Over Time
Authors
- 1. Varun Jain (Harvard University)
- 2. James Lennon (Harvard University)
- 3. Harshita Gupta (Harvard University)
BibTeX Citation
@inproceedings{jain_sigmod19,
title = {{LSM-Trees and B-Trees: The Best of Both Worlds}},
author = {Jain, Varun and Lennon, James and Gupta, Harshita},
series = {{SIGMOD} '19},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3299869.3300097},
url = {https://dl.acm.org/doi/10.1145/3299869.3300097},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,479 | Cosine: A Cloud-Cost Optimized Self-Designing Key-Value Storage Engine | 2022 | VLDB | 7.2695068e-05 |
| 10,133 | CloudJump: Optimizing Cloud Databases for Cloud Storages | 2022 | VLDB | 5.0751052e-05 |
| 10,902 | Enhancing Database Write Performance with the Write Operation Pushdown Framework | 2026 | VLDB | 4.9793485e-05 |
| 11,500 | Native Cloud Object Storage in Db2 Warehouse: Implementing a Fast and Cost-Efficient Cloud Storage Architecture | 2024 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
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 |
|---|---|---|---|---|
| 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 |
| 1,605 | The Data Calculator*: Data Structure Design and Cost Synthesis from First Principles and Learned Cost Models | 2018 | SIGMOD | 0.00010093796 |
| 1,889 | Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn | 2019 | CIDR | 9.4273689e-05 |
| 4,885 | Design Tradeoffs of Data Access Methods | 2016 | SIGMOD | 6.3706825e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,329 | How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice | 2025 | SIGMOD |
| 2 | 1,422 | The Log-Structured Merge-Bush & the Wacky Continuum | 2019 | SIGMOD |
| 3 | 7,594 | Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems | 2019 | VLDB |
| 4 | 6,124 | Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads | 2023 | SIGMOD |
| 5 | 5,046 | Dissecting, Designing, and Optimizing LSM-based Data Stores | 2022 | SIGMOD |
| 6 | 6,932 | Breaking Down Memory Walls in LSM-based Storage Systems | 2020 | SIGMOD |
| 7 | 1,889 | Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn | 2019 | CIDR |
| 8 | 9,998 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 9 | 9,181 | Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space | 2024 | SIGMOD |
| 10 | 12,208 | Splaying Log-Structured Merge-Trees | 2018 | SIGMOD |