Succinct Range Filters.
We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests. Unlike traditional Bloom filters, SuRF supports both singlekey lookups and common range queries, such as range counts. SuRF is based on a new data structure called the Fast Succinct Trie...
| Published in: | Communications of the ACM Vol. 64; no. 4; pp. 166 - 174 |
|---|---|
| Main Authors: | , , , , , , |
| Format: | Article |
| Published: |
Association for Computing Machinery
Apr2021
|
| Subjects: | |
| Online Access: | View this record in EBSCOhost |