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
- 2. Fan Wang
- 3. Dingheng Mo
- 4. Siqiang Luo
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,769 | Oasis: An Optimal Disjoint Segmented Learned Range Filter | 2024 | VLDB | 5.3326049e-05 |
| 8,011 | CAMAL: Optimizing LSM-trees via Active Learning | 2024 | SIGMOD | 4.6022693e-05 |
| 8,333 | How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice | 2025 | SIGMOD | 4.5390511e-05 |
| 8,804 | ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic Workloads | 2026 | VLDB | 4.4424232e-05 |
| 9,322 | Are Joins over LSM-trees Ready? Take RocksDB as an Example | 2025 | VLDB | 4.351469e-05 |
| 9,390 | Rethinking The Compaction Policies in LSM-trees | 2025 | SIGMOD | 4.341433e-05 |
| 10,176 | Improving Range Scan Performance in LSM-trees with Group Caching | 2026 | SIGMOD | 4.1905499e-05 |
| 10,379 | Aster: Enhancing LSM-structures for Scalable Graph Database | 2025 | SIGMOD | 4.1905499e-05 |
| 10,853 | AXE: A Task Decomposition Approach to Learned LSM Tuning | 2025 | VLDB | 4.1905499e-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 | Pagerank |
|---|---|---|---|---|
| 10,176 | Improving Range Scan Performance in LSM-trees with Group Caching | 2026 | SIGMOD | 4.1905499e-05 |
| 3,797 | Constructing and Analyzing the LSM Compaction Design Space | 2021 | VLDB | 6.7552936e-05 |
| 5,801 | Dissecting, Designing, and Optimizing LSM-based Data Stores | 2022 | SIGMOD | 5.3217858e-05 |
| 7,743 | Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems | 2019 | VLDB | 4.6581858e-05 |
| 9,390 | Rethinking The Compaction Policies in LSM-trees | 2025 | SIGMOD | 4.341433e-05 |
| 7,217 | Breaking Down Memory Walls in LSM-based Storage Systems | 2020 | SIGMOD | 4.7936491e-05 |
| 2,112 | The Log-Structured Merge-Bush & the Wacky Continuum | 2019 | SIGMOD | 9.5244583e-05 |
| 7,341 | LSM-Trees and B-Trees: The Best of Both Worlds | 2019 | SIGMOD | 4.7522998e-05 |
| 608 | Monkey: Optimal Navigable Key-Value Store | 2017 | SIGMOD | 0.00019233548 |
| 7,623 | Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads | 2023 | SIGMOD | 4.6890662e-05 |