Asymptotically Optimal Filters

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A filter, such as a Bloom filter, maintains a compact, probabilistic representation of a set S of elements from a universe U. The challenge is to design a filter that uses optimal space and requires a constant number of memory accesses per query while supporting both insertions and deletions. The two main modern constructions of filters are cuckoo filters and adaptive filters built on quotient filters. Cuckoo filters (Fan et al. 2014) perform well in practice but rely on unproven heuristics. Adaptive filters (Bender et al. 2012, 2018) as well as cuckoo filters experience performance degradation as the number of stored elements approaches the capacity of the filter. Thus, space utilization is sub-optimal. We present a filter that, with high probability, asymptotically achieves optimal space and performance even if the number of elements reaches the capacity of the filter. This construction copes with the problem of "false deletes" (that it has in common with cuckoo filters) via an elegant connection to adaptive filters. Time permitting, applications that benefit from adaptive filters will be discussed. Joint work with Michael A. Bender, Ioana O. Bercea, Alex Conway, Tomer Even, Martin Farach-Colton, Rob Johnson.
Original languageUndefined/Unknown
Title of host publicationThe 31st ACM Symposium on Parallelism in Algorithms and Architectures
Place of PublicationNew York, NY, USA
Pages47
Number of pages1
DOIs
StatePublished - Jun 2019

Publication series

NameSPAA '19
PublisherAssociation for Computing Machinery

Keywords

  • bloom filters
  • disk access model
  • power of two choices

Cite this