Bloom filter is a probabilistic data structure that tells you if a value might be in the set.

- Stackoverflow.com Wiki
2 articles, 0 books.

The Bloom filter is a space efficient, probabilistic data structure, designed to test the membership of elements to a set. The trade-off for being a space efficient data structure is it may return false positives, but always returns definite negatives.


A Bloom filter allows you to test whether an element belongs in a set or not. Actually, that’s untrue. It doesn’t. It allows you to test if an element most likely belongs to a set, or if it absolutely doesn’t.