Bloom filter
nounEtymology
Conceived by Burton Howard Bloom in 1970.
Definitions
A space-efficient probabilistic data structure that is used to test whether an element is…
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.
The neighborhood
Vish — recursive loop
No curated loop yet for Bloom filter. Loops are being traced one word at a time while the ingestion pipeline matures.
sense glosses and etymology drawn from English Wiktionary · source · CC-BY-SA