Bloom Filter Membership
Learn how this probabilistic data structure offers instant set membership checks with zero false negatives.
Jul 2, 20261 min read
Command Palette
Search for a command to run...
#bloom-filter
Articles tagged with #bloom-filter
Bloom Filters Explained: Membership Testing with Zero False Negatives
How a bit array and k hash functions answer 'definitely not in this set' in O(1) — and why false negatives are mathematically impossible.
May 3, 202619 min read26Probabilistic Data Structures: A Practical Guide to Bloom Filters, HyperLogLog, and Count-Min Sketch
Trade exact answers for fixed memory and O(1) operations: a comparative guide to Bloom Filters, HyperLogLog, and Count-Min Sketch.
Apr 5, 202614 min read198How Bloom Filters Work: The Probabilistic Set
Can you check if a username is taken without querying the database? Yes. Bloom Filters are a space-efficient probabilistic data structure.
Mar 9, 202613 min read28