Bloom filter

== English == === Etymology === Conceived by Burton Howard Bloom in 1970. === Pronunciation === === Noun === Bloom filter (plural Bloom filters) (computing theory) A space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not.