Probabilistic Data
- Bloom filter = bitset + k hashes
- False positives possible
- Zero false negatives
1 / 2
Use cases
- Cache membership
- Web crawlers
- Large‑scale analytics
2 / 2
Use arrow keys or click edges to navigate. Press H to toggle help, F for fullscreen.