DBScholar

Back to papers

GRF: A Global Range Filter for LSM-Trees with Shape Encoding

Summary: GRF: a RocksDB global range filter that cuts per-query filter probes from many to one, targeting CPU bottlenecks in LSM read paths. Novel shape encoding makes global run-ID filters correct under MVCC and efficient to update, outperforming prior point/range filters. (summarized by gpt-5.4-mini on May 24 2026)

Paper ID
hba6beccbec495108
Venue
SIGMOD
Year
2024
Pagerank
6.4334982e-05
Overall Rank
4,753 | 68.06%
DOI
10.1145/3654944

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{wang_sigmod24,
        title = {{GRF: A Global Range Filter for LSM-Trees with Shape Encoding}},
        author = {Wang, Hengrui and Guo, Te and Yang, Junzhao and Zhang, Huanchen},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3654944},
        url = {https://dl.acm.org/doi/10.1145/3654944},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 27 of 27 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
40 The Case for Learned Index Structures 2018 SIGMOD 0.00046363107
400 Monkey: Optimal Navigable Key-Value Store 2017 SIGMOD 0.00019124757
422 ALEX: An Updatable Adaptive Learned Index 2020 SIGMOD 0.00018488849
485 BLOCKBENCH: A Framework for Analyzing Private Blockchains 2017 SIGMOD 0.00017466311
753 Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging 2018 SIGMOD 0.00014232329
768 FITing-Tree: A Data-aware Index Structure 2019 SIGMOD 0.00014107655
835 Benchmarking Learned Indexes 2021 VLDB 0.00013575971
889 SuRF: Practical Range Query Filtering with Fast Succinct Tries 2018 SIGMOD 0.00013243846
1,313 X-Engine: An Optimized Storage Engine for Large-scale E-commerce Transaction Processing 2019 SIGMOD 0.00011055196
1,422 The Log-Structured Merge-Bush & the Wacky Continuum 2019 SIGMOD 0.00010720711
1,982 Chucky: A Succinct Cuckoo Filter for LSM-Tree 2021 SIGMOD 9.2570284e-05
2,664 Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores 2020 SIGMOD 8.1532061e-05
2,771 Constructing and Analyzing the LSM Compaction Design Space 2021 VLDB 8.0338932e-05
2,839 SNARF: A Learning-Enhanced Range Filter 2022 VLDB 7.9490277e-05
2,868 Spooky: Granulating LSM-Tree Compactions Correctly 2022 VLDB 7.9205462e-05
3,285 Performance-Optimal Filtering: Bloom Overtakes Cuckoo at High Throughput 2019 VLDB 7.4525495e-05
3,480 Cosine: A Cloud-Cost Optimized Self-Designing Key-Value Storage Engine 2022 VLDB 7.2661848e-05
3,683 SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy 2023 SIGMOD 7.0996633e-05
3,714 Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design 2021 SIGMOD 7.0749199e-05
4,198 Proteus: A Self-Designing Range Filter 2022 SIGMOD 6.7385809e-05
4,627 Stacked Filters: Learning to Filter by Structure 2021 VLDB 6.4939164e-05
4,685 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.4692031e-05
5,084 InfiniFilter: Expanding Filters to Infinity and Beyond 2023 SIGMOD 6.2824822e-05
5,250 Endure: A Robust Tuning Paradigm for LSM Trees Under Workload Uncertainty 2022 VLDB 6.2092552e-05
6,123 Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads 2023 SIGMOD 5.8771312e-05
6,195 Prefix Filter: Practically and Theoretically Better Than Bloom 2022 VLDB 5.8528165e-05
7,394 GeckoFTL: Scalable Flash Translation Techniques For Very Large Flash Devices 2016 SIGMOD 5.5347771e-05
Previous Page 1 / 1 Next

Semantically Similar Papers