A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is...

A counting Bloom filter is a probabilistic data structure that is used to test whether the number of occurrences of a given element in a sequence exceeds...

cuckoo filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set, like a Bloom filter does....

rate of ϵ {\displaystyle \epsilon } . Bloom filters are the most known AMQ filter, but there are other AMQ filters that support additional operations or...

Bloom filters are space-efficient probabilistic data structures used to test whether an element is a part of a set. Bloom filters require much less space...

Bloom filter, a probabilistic method to find a subset of a given set Bloom (shader effect), a graphics effect used in modern 3D computer games Bloom (software)...

can be considered an implementation of a counting Bloom filter (Fan et al., 1998) or multistage-filter. However, they are used differently and therefore...

quotient filter requires less space than a comparable Bloom filter when the target false-positive rate is less than 1/64. Quotient filters are AMQs and...

to implement (lockless) priority queues and concurrent dictionaries. Bloom filter Skip graph Papadakis, Thomas (1993). Skip Lists and Probabilistic Analysis...

hash tables. In 1970, Burton Howard Bloom introduced an approximate-membership data structure known as the Bloom filter. In 1989, Raimund Seidel and Cecilia...