SuRF: Practical Range Query Filtering with Fast Succinct Tries

SIGMOD/PODS '18: International Conference on Management of Data Houston TX USA June, 2018, pp. 323-336, 2018.

Cited by: 53|Bibtex|Views217|DOI:https://doi.org/10.1145/3183713.3196931
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|dl.acm.org

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

 

Best Paper
Best Paper of SIGMOD, 2018
Tags
Comments