Succinct Range Filters

ACM SIGMOD Record, pp. 78-85, 2019.

Cited by: 0|Bibtex|Views111|DOI:https://doi.org/10.1145/3371316.3371335
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. SuRF is based on a new data structure called the Fast Succinct Trie (FST) that matches the point and range query performance of s...More

Code:

Data:

Your rating :
0

 

Tags
Comments