Improving Range Scan Performance in LSM-trees with Group Caching
Summary: LSM-tree range scans suffer from asymmetric I/O value across levels; Group Cache exploits this by caching minimal KV Groups, the smallest query-relevant sets, instead of blocks or full results. A size-aware policy favors small/high-utility groups and handles compaction/hotness, yielding up to 3x faster scans or same speed with 75% less cache. (summarized by gpt-5-mini on Apr 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Hengrui Wang (Tsinghua University)
- 2. Jiaoyi Zhang (East China Normal University)
- 3. Jiansheng Qiu (Tsinghua University)
- 4. Fangzhou Yuan (Tsinghua University)
- 5. Huanchen Zhang (Shanghai Qi Zhi Institute; Tsinghua University)
BibTeX Citation
@inproceedings{wang_sigmod26,
title = {{Improving Range Scan Performance in LSM-trees with Group Caching}},
author = {Wang, Hengrui and Zhang, Jiaoyi and Qiu, Jiansheng and Yuan, Fangzhou and Zhang, Huanchen},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3786661},
url = {https://dl.acm.org/doi/10.1145/3786661},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 32 of 32 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 | 3,005 | Constructing and Analyzing the LSM Compaction Design Space | 2021 | VLDB |
| 2 | 7,274 | LSM-Trees and B-Trees: The Best of Both Worlds | 2019 | SIGMOD |
| 3 | 6,843 | Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads | 2023 | SIGMOD |
| 4 | 857 | SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data | 2017 | VLDB |
| 5 | 11,908 | Splaying Log-Structured Merge-Trees | 2018 | SIGMOD |
| 6 | 6,828 | Breaking Down Memory Walls in LSM-based Storage Systems | 2020 | SIGMOD |
| 7 | 9,457 | Rethinking The Compaction Policies in LSM-trees | 2025 | SIGMOD |
| 8 | 7,693 | CaaS-LSM: Compaction-as-a-Service for LSM-based Key-Value Stores in Storage Disaggregated Infrastructure | 2024 | SIGMOD |
| 9 | 4,664 | GRF: A Global Range Filter for LSM-Trees with Shape Encoding | 2024 | SIGMOD |
| 10 | 9,021 | Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space | 2024 | SIGMOD |