Category
bloom filter
2 articles
Probabilistic Data Structures Explained: Bloom Filters, HyperLogLog, and Count-Min Sketch
TLDR: Probabilistic data structures — Bloom Filters, Count-Min Sketch, HyperLogLog, and Cuckoo Filters — trade a small, bounded probability of being wrong for orders-of-magnitude better memory efficiency and O(1) speed. Bloom filters answer "definite...
•30 min read
How Bloom Filters Work: The Probabilistic Set
TLDR TLDR: A Bloom Filter is a bit array + multiple hash functions that answers "Is X in the set?" in $O(1)$ constant space. It can return false positives (say "yes" when the answer is "no") but never false negatives (never says "no" when the answer...
•13 min read