Succinct Range Filters

ACM Transactions on Database Systems, pp. 1-31, 2020.

Cited by: 0|Bibtex|Views70|DOI:https://doi.org/10.1145/3375660
EI
Other Links: dl.acm.org|dblp.uni-trier.de

Abstract:

We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests. Unlike traditional Bloom filters, SuRF supports both single-key lookups and common range queries: open-range queries, closed-range queries, and range counts. SuRF is based on a new data structure called the Fast Succinct Trie (...More

Code:

Data:

Your rating :
0

 

Tags
Comments