Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space
Summary: LSM-tree design space generalized beyond fixed leveled/Tiered patterns: per-level runs, size ratios, and Bloom filters are optimized jointly. Key insight is a large last level for point lookups plus a runs/ratio correlation yielding Moose/Smoose, outperforming RocksDB baselines across mixed workloads. (summarized by gpt-5.4-mini on May 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Junfeng Liu (Nanyang Technological University)
- 2. Fan Wang (Nanyang Technological University)
- 3. Dingheng Mo (Nanyang Technological University)
- 4. Siqiang Luo (Nanyang Technological University)
BibTeX Citation
@inproceedings{liu_sigmod24,
title = {{Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space}},
author = {Liu, Junfeng and Wang, Fan and Mo, Dingheng and Luo, Siqiang},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3654978},
url = {https://dl.acm.org/doi/10.1145/3654978},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,261 | Oasis: An Optimal Disjoint Segmented Learned Range Filter | 2024 | VLDB | 6.2955539e-05 |
| 7,757 | CAMAL: Optimizing LSM-trees via Active Learning | 2024 | SIGMOD | 5.5508469e-05 |
| 8,156 | How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice | 2025 | SIGMOD | 5.4765648e-05 |
| 8,811 | ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic Workloads | 2026 | VLDB | 5.3652966e-05 |
| 8,896 | Aster: Enhancing LSM-structures for Scalable Graph Database | 2025 | SIGMOD | 5.3495662e-05 |
| 9,457 | Rethinking The Compaction Policies in LSM-trees | 2025 | SIGMOD | 5.2642945e-05 |
| 9,465 | Are Joins over LSM-trees Ready? Take RocksDB as an Example | 2025 | VLDB | 5.2634238e-05 |
| 10,465 | Improving Range Scan Performance in LSM-trees with Group Caching | 2026 | SIGMOD | 5.093636e-05 |
| 11,073 | AXE: A Task Decomposition Approach to Learned LSM Tuning | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 37 of 37 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,465 | Improving Range Scan Performance in LSM-trees with Group Caching | 2026 | SIGMOD |
| 2 | 3,005 | Constructing and Analyzing the LSM Compaction Design Space | 2021 | VLDB |
| 3 | 5,229 | Dissecting, Designing, and Optimizing LSM-based Data Stores | 2022 | SIGMOD |
| 4 | 7,459 | Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems | 2019 | VLDB |
| 5 | 9,457 | Rethinking The Compaction Policies in LSM-trees | 2025 | SIGMOD |
| 6 | 6,828 | Breaking Down Memory Walls in LSM-based Storage Systems | 2020 | SIGMOD |
| 7 | 1,502 | The Log-Structured Merge-Bush & the Wacky Continuum | 2019 | SIGMOD |
| 8 | 7,274 | LSM-Trees and B-Trees: The Best of Both Worlds | 2019 | SIGMOD |
| 9 | 446 | Monkey: Optimal Navigable Key-Value Store | 2017 | SIGMOD |
| 10 | 6,843 | Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads | 2023 | SIGMOD |