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:
“The spring is here, young and beautiful as ever, and absolutely shocking in its display of reckless maternity; but the Judas tree will bloom for you on the Bosphorus if you get there in time. No one ever loved the dog-wood and Judas tree as I have done, and it is my one crown of life to be sure that I am going to take them with me to heaven to enjoy real happiness with the Virgin and them.”
—Henry Brooks Adams (1838–1918)