A Space Lower Bound for Dynamic Approximate Membership Data Structures

  title={A Space Lower Bound for Dynamic Approximate Membership Data Structures},
  author={Shachar Lovett and Ely Porat},
  journal={SIAM J. Comput.},
An approximate membership data structure is a randomized data structure representing a set which supports membership queries. It allows for a small false positive error rate but has no false negative errors. Such data structures were first introduced by Bloom in the 1970s and have since had numerous applications, mainly in distributed systems, database systems, and networks. The algorithm of Bloom (known as a Bloom filter) is quite effective: it can store an approximation of a set $S$ of size… 
1 Citations
Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange
Bloom filter encryption (BFE), which is derived from the probabilistic Bloom filter data structure, is introduced and different constructions of BFE schemes are described and it is shown how these yield new puncturable encryption mechanisms with extremely efficient puncturing.


Succinct Data Structures for Retrieval and Approximate Membership
It is shown that for any k, query time O(k) can be beachieved using space that is within a factor 1 + e-k of optimal, asymptotically forlarge n.
An Optimal Bloom Filter Replacement Based on Matrix Solving
This work suggests a method for holding a dictionary data structure, which maps keys to values, in the spirit of Bloom Filters, and suggests a data structure that requires only nk bits space, has O (n) preprocessing time, and has a O (logn ) query time.
Network Applications of Bloom Filters: A Survey
The aim of this paper is to survey the ways in which Bloom filters have been used and modified in a variety of network problems, with the aim of providing a unified mathematical and practical framework for understanding them and stimulating their use in future applications.
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
This paper construction is a two-level variant of cuckoo hashing, augmented with a ``backyard'' that handles a large fraction of the elements, together with a de-amortized perfect hashing scheme for eliminating the dependency on $\boldsymbol{n}$ memory words, and guarantees constant-time operations in the worst case with high probability.
An optimal Bloom filter replacement
A new RAM data structure is considered for storing an approximation of S to S such that S ⊆ S and any element not in S belongs to S with probability at most ∈, and the space usage is within a lower order term of the lower bound.
Why simple hash functions work: exploiting the entropy in a data stream
It is demonstrated that the strong performance of universal hash functions in practice can arise naturally from a combination of the randomness of the hash function and the data.
Space/time trade-offs in hash coding with allowable errors
Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.
Exact and approximate membership testers
The question of how much space is needed to represent a set is considered, given a finite universe U and some subset V and a procedure that for each element s in U determines if s is in V.
Succinct dynamic dictionaries and trees, in Proceedings of the 30th International Conference on Automata, Languages, and Programming (ICALP ’03)
  • 2003