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.
Brian shows you how to code the adds and contains functions to implement a Bloom filter. Source: Internet
Most of the literature on Bloom filter uses highly symbolic and/or mathematical descriptions to describe it. Source: Internet