Probabilistic Data Structures
Advanced · 15 min read · High-Level Design, Data Processing & Specialised Systems
Bloom filters, HyperLogLog, Count-Min Sketch and top-K heavy hitters.
This is an Advanced lesson, part of Premium. What it covers:
- Bloom filter — "have I seen this before?"
- HyperLogLog — "how many distinct?"
- Count-Min Sketch — "how often has X occurred?"
- Top-K / heavy hitters
- Comparison
- Interview questions
- Practice
- Further reading