Bloom Filter
Last updated
Last updated
A Bloom Filter (located in Pronghorn
) is a space-efficient probabilistic data structure used in Pronghorn for fast data lookup.
Pronghorn uses for its hash-based lookups.
n
is the number of items in the filter
p
is the probability of false positives, float between 0 and 1 or a number indicating 1-in-p
template
is a previous BloomFilter that you can re-use
a
and b
are previous bloom filters for intersection checking
intersection
determines if there is an intersection