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 n by using only ≈ 1.44n log2(1/ε) bits while having false positive error ε. This is within a constant factor of the information-theoretic lower bound of n log2(1/ε) for storing such sets. Closing this gap is an important open problem, as Bloom filters ar...
A Bloom filter is a very compact data structure that supports approximate membership queries on a se...
A Bloom Filter is an efficient randomized data structure for membership queries on a set with a cert...
Abstract. This paper deals with the problem of storing a subset of elements from the bounded univers...
An approximate membership data structure is a randomized data structure representing a set which sup...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
A Bloom Filter is a simple space-efficient randomized data structure for representing a set in order...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
This paper considers space-efficient data structures for storing an approximation S ′ to a set S suc...
A Bloom filter is a method for reducing the space (memory) required for representing a set by allowi...
A Bloom filter is a simple randomized data structure that answers membership query with no false neg...
Bloom Filter is a simple space-efficient randomized data structure for representing a set in order t...
Let U be the set of integers {1,..., U}, and S of a subset of U with size n ( ≤ U). We want to prepr...
The membership problem asks to maintain a set S ? [u], supporting insertions and membership queries,...
We study the it static membership problem: Given a set S of at most n keys drawn from a universe U o...
We study data structures in the presence of adversarial noise. We want to encode a given object in a...
A Bloom filter is a very compact data structure that supports approximate membership queries on a se...
A Bloom Filter is an efficient randomized data structure for membership queries on a set with a cert...
Abstract. This paper deals with the problem of storing a subset of elements from the bounded univers...
An approximate membership data structure is a randomized data structure representing a set which sup...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
A Bloom Filter is a simple space-efficient randomized data structure for representing a set in order...
We study the dynamic membership (or dynamic dictionary) problem, which is one of the most fundamenta...
This paper considers space-efficient data structures for storing an approximation S ′ to a set S suc...
A Bloom filter is a method for reducing the space (memory) required for representing a set by allowi...
A Bloom filter is a simple randomized data structure that answers membership query with no false neg...
Bloom Filter is a simple space-efficient randomized data structure for representing a set in order t...
Let U be the set of integers {1,..., U}, and S of a subset of U with size n ( ≤ U). We want to prepr...
The membership problem asks to maintain a set S ? [u], supporting insertions and membership queries,...
We study the it static membership problem: Given a set S of at most n keys drawn from a universe U o...
We study data structures in the presence of adversarial noise. We want to encode a given object in a...
A Bloom filter is a very compact data structure that supports approximate membership queries on a se...
A Bloom Filter is an efficient randomized data structure for membership queries on a set with a cert...
Abstract. This paper deals with the problem of storing a subset of elements from the bounded univers...