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
6968
Venue
SIGMOD
Year
2024
Pagerank
6.5787544e-05
Overall Rank
4,664 | 68.01%
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
43 The Case for Learned Index Structures 2018 SIGMOD 0.00046060254
446 Monkey: Optimal Navigable Key-Value Store 2017 SIGMOD 0.00018332392
447 ALEX: An Updatable Adaptive Learned Index 2020 SIGMOD 0.00018322593
478 BLOCKBENCH: A Framework for Analyzing Private Blockchains 2017 SIGMOD 0.00017829906
790 FITing-Tree: A Data-aware Index Structure 2019 SIGMOD 0.0001401445
831 Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging 2018 SIGMOD 0.00013748512
847 Benchmarking Learned Indexes 2021 VLDB 0.0001365768
880 SuRF: Practical Range Query Filtering with Fast Succinct Tries 2018 SIGMOD 0.00013432693
1,347 X-Engine: An Optimized Storage Engine for Large-scale E-commerce Transaction Processing 2019 SIGMOD 0.00011073571
1,502 The Log-Structured Merge-Bush & the Wacky Continuum 2019 SIGMOD 0.00010557694
1,954 Chucky: A Succinct Cuckoo Filter for LSM-Tree 2021 SIGMOD 9.4208165e-05
2,698 Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores 2020 SIGMOD 8.2450522e-05
2,919 SNARF: A Learning-Enhanced Range Filter 2022 VLDB 7.9628657e-05
3,005 Constructing and Analyzing the LSM Compaction Design Space 2021 VLDB 7.8608206e-05
3,054 Spooky: Granulating LSM-Tree Compactions Correctly 2022 VLDB 7.8090808e-05
3,510 Performance-Optimal Filtering: Bloom Overtakes Cuckoo at High Throughput 2019 VLDB 7.3561488e-05
3,577 Cosine: A Cloud-Cost Optimized Self-Designing Key-Value Storage Engine 2022 VLDB 7.2930211e-05
3,773 SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy 2023 SIGMOD 7.1384476e-05
3,798 Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design 2021 SIGMOD 7.1165678e-05
4,119 Proteus: A Self-Designing Range Filter 2022 SIGMOD 6.8907395e-05
4,532 Stacked Filters: Learning to Filter by Structure 2021 VLDB 6.6436681e-05
4,665 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.5780693e-05
4,960 InfiniFilter: Expanding Filters to Infinity and Beyond 2023 SIGMOD 6.4280133e-05
5,766 Endure: A Robust Tuning Paradigm for LSM Trees Under Workload Uncertainty 2022 VLDB 6.094771e-05
6,539 Prefix Filter: Practically and Theoretically Better Than Bloom 2022 VLDB 5.8473945e-05
6,843 Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads 2023 SIGMOD 5.7573899e-05
7,249 GeckoFTL: Scalable Flash Translation Techniques For Very Large Flash Devices 2016 SIGMOD 5.6634301e-05
Previous Page 1 / 1 Next

Semantically Similar Papers