Bloom filter
Bloom filter noun: 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.
Noun
Bloom filter (plural Bloom filters)
- 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.
- A Bloom filter is a set-like data structure that is highly efficient in its use of space. It supports two operations only: insertion and membership querying.2008, Bryan O'Sullivan, John Goerzen, Donald Bruce Stewart, Real World Haskell: Code You Can Believe In, O'Reilly Media, →ISBN, page 581
Forms of Bloom filter
| plural | Bloom filters |
|---|
Origin of Bloom filter
Conceived by Burton Howard Bloom in 1970.
Questions about Bloom filter
- What does Bloom filter mean?
- Bloom filter means 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.
- What part of speech is Bloom filter?
- Bloom filter is a noun.
- What is the plural of Bloom filter?
- The plural of Bloom filter is Bloom filters.
Words near Bloom filter in the dictionary
Source and license
Adapted from Wiktionary: Bloom filter (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Pronunciation audio from Wikimedia Commons, each file under its own free license: LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-Bloom filter.wav.
Cite this entry: “Bloom filter.” Word.ws, https://word.ws/bloom_filter. Based on Wiktionary, CC BY-SA 4.0.
