mlsanityData to 7 Oct 2026

Proteus: A Self-Designing Range Filter

arXiv 2207.01503 ↗First posted 30 Jun 2022cs.DB cs.DS cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

We introduce Proteus, a novel self-designing approximate range filter, which configures itself based on sampled data in order to optimize its false positive rate (FPR) for a given space requirement. Proteus unifies the probabilistic and deterministic design spaces of state-of-the-art range filters to achieve robust performance across a larger variety of use cases. At the core of Proteus lies our Contextual Prefix FPR (CPFPR) model - a formal framework for the FPR of prefix-based filters across their design spaces. We empirically demonstrate the accuracy of our model and Proteus' ability to optimize over both synthetic workloads and real-world datasets. We further evaluate Proteus in RocksDB and show that it is able to improve end-to-end performance by as much as 5.3x over more brittle state-of-the-art methods such as SuRF and Rosetta. Our experiments also indicate that the cost of modeling is not significant compared to the end-to-end performance gains and that Proteus is robust to workload shifts.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 16 of its 53 references that are in the map. First posted on arXiv 30 Jun 2022.

Builds on

16 of 53 references.

References · 16

  1. 2017The Case for Learned Index Structurescited by 188
  2. 2019A Model for Learned Bloom Filters, and Optimizing by Sandwichingcited by 64
  3. 2020Benchmarking Learned Indexescited by 27
  4. 2019SOSD: A Benchmark for Learned Indexescited by 21
  5. 2019Adaptive Learned Bloom Filter (Ada-BF): Efficient Utilization of the Classifiercited by 15
  6. 2020Partitioned Learned Bloom Filtercited by 10
  7. 2014AsterixDB: A Scalable, Open Source BDMScited by 4
  8. 2017Bloom Filters, Adaptivity, and the Dictionary Problemcited by 4
  9. 2017Adaptive Cuckoo Filterscited by 3
  10. 2019Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filterscited by 3
  11. 2021Ribbon filter: practically smaller than Bloom and Xorcited by 3
  12. 2014GraphChi-DB: Simple Design for a Scalable Graph Database System -- on Just a PCcited by 1
4 more
  1. 2014Approximate Range Emptiness in Constant Time and Optimal Spacecited by 1
  2. 2015Faster 64-bit universal hashing using carry-less multiplicationscited by 1
  3. 2018vChain: Enabling Verifiable Boolean Range Queries over Blockchain Databasescited by 1
  4. 2020Coconut Palm: Static and Streaming Data Series Exploration Now in your Palmcited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 1.

2 papers.