A Bloom filter, conceived by Burton Howard Bloom in 1970, is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive retrieval results are possible, but false negatives are not; i.e. a query returns either "inside set (may be wrong)" or "definitely not in set". Elements can be added to the set, but not removed (though this can be addressed with a counting filter). The more elements that are added to the set, the larger the probability of false positives.
Read more about Bloom Filter: Algorithm Description, Space and Time Advantages, Probability of False Positives, Interesting Properties, Examples, Alternatives
Famous quotes containing the word bloom:
“To what good, in the alleys of the lilacs,
O caliper, do you scratch your buttocks
And tell the divine ingénue, your companion,
That this bloom is the bloom of soap
And this fragrance the fragrance of vegetal?”
—Wallace Stevens (1879–1955)