AI engineering glossary · Data structures algorithms
What is bloom filter?
Bloom filter: A compact probabilistic structure that tells whether an item is definitely absent or possibly present in a set. It uses a bit array and several hash functions, allows false positives but never false negatives, and saves memory compared with storing the items.
Bloom filter: an example
A database checks a Bloom filter before reading disk: if it says 'absent' the disk read is skipped, and if it says 'present' the record is looked up to confirm.
Related terms
More Data structures algorithms terms
- Breadth-first search
- Bubble sort
- Call stack
- Circular buffer
- Coin change problem
- Collision
- Comparison sort
- Connected components
Where you learn it
Bloom filter is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.