DBScholar

Back to papers

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)

Paper ID
h9202fac65abc9d77
Venue
SIGMOD
Year
2026
Pagerank
4.9605343e-05
Overall Rank
10,724 | 28.12%
DOI
10.1145/3786661
PDF
Download (CC BY 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Rank Cited Paper Year Venue Pagerank
238 LinkBench: a Database Benchmark Based on the Facebook Social Graph 2013 SIGMOD 0.00023594951
261 bLSM: A General Purpose Log Structured Merge Tree 2012 SIGMOD 0.00022862412
402 Monkey: Optimal Navigable Key-Value Store 2017 SIGMOD 0.00019070605
487 BLOCKBENCH: A Framework for Analyzing Private Blockchains 2017 SIGMOD 0.00017413439
761 Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging 2018 SIGMOD 0.00014191047
834 Benchmarking Learned Indexes 2021 VLDB 0.00013539098
892 SuRF: Practical Range Query Filtering with Fast Succinct Tries 2018 SIGMOD 0.00013207671
1,324 X-Engine: An Optimized Storage Engine for Large-scale E-commerce Transaction Processing 2019 SIGMOD 0.00011019001
1,429 The Log-Structured Merge-Bush & the Wacky Continuum 2019 SIGMOD 0.00010685393
1,991 Chucky: A Succinct Cuckoo Filter for LSM-Tree 2021 SIGMOD 9.2264312e-05
2,667 Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores 2020 SIGMOD 8.1324472e-05
2,780 Constructing and Analyzing the LSM Compaction Design Space 2021 VLDB 8.0073289e-05
2,844 SNARF: A Learning-Enhanced Range Filter 2022 VLDB 7.9291659e-05
3,249 TreeLine: An Update-In-Place Key-Value Store for Modern Storage 2023 VLDB 7.4761584e-05
3,351 LittleTable: A Time-Series Database and Its Uses 2017 SIGMOD 7.3729208e-05
3,692 SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy 2023 SIGMOD 7.0761873e-05
4,207 Proteus: A Self-Designing Range Filter 2022 SIGMOD 6.7226406e-05
4,688 TOAIN: A Throughput Optimizing Adaptive Index for Answering Dynamic kNN Queries on Road Networks 2018 VLDB 6.4517069e-05
4,693 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.4490657e-05
4,706 Grafite: Taming Adversarial Queries with Optimal Range Filters 2024 SIGMOD 6.4426536e-05
4,771 GRF: A Global Range Filter for LSM-Trees with Shape Encoding 2024 SIGMOD 6.412225e-05
4,901 Oasis: An Optimal Disjoint Segmented Learned Range Filter 2024 VLDB 6.3483238e-05
6,137 Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads 2023 SIGMOD 5.8576977e-05
6,500 Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index 2024 VLDB 5.7478171e-05
6,558 Memento Filter: A Fast, Dynamic, and Robust Range Filter 2024 SIGMOD 5.7292202e-05
7,411 GeckoFTL: Scalable Flash Translation Techniques For Very Large Flash Devices 2016 SIGMOD 5.5164757e-05
7,925 CAMAL: Optimizing LSM-trees via Active Learning 2024 SIGMOD 5.4086685e-05
8,555 SA-LSM: Optimize Data Layout for LSM-tree Based Storage using Survival Analysis 2022 VLDB 5.3021893e-05
8,666 Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees 2025 SIGMOD 5.277223e-05
9,111 MirrorKV: An Efficient Key-Value Store on Hybrid Cloud Storage with Balanced Performance of Compaction and Querying 2023 SIGMOD 5.208561e-05
9,162 Rethinking The Compaction Policies in LSM-trees 2025 SIGMOD 5.2035666e-05
9,215 Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space 2024 SIGMOD 5.1921944e-05
Previous Page 1 / 1 Next

Semantically Similar Papers