3.7 Probabilistic Data Structures
Bloom filters, cuckoo filters, count-min sketch, HyperLogLog, MinHash, reservoir sampling, skip lists, and treaps as probabilistic structures.
3.7 Probabilistic data structures, 15
| index | slug | name |
|---|---|---|
| 1 | probabilistic-data-structure | Probabilistic Data Structure |
| 2 | bloom-filter-probabilistic | Bloom Filter |
| 3 | counting-bloom-filter-probabilistic | Counting Bloom Filter |
| 4 | cuckoo-filter-probabilistic | Cuckoo Filter |
| 5 | quotient-filter-probabilistic | Quotient Filter |
| 6 | xor-filter-probabilistic | XOR Filter |
| 7 | count-min-sketch | Count Min Sketch |
| 8 | count-sketch | Count Sketch |
| 9 | hyperloglog | HyperLogLog |
| 10 | minhash | MinHash |
| 11 | reservoir-sampling | Reservoir Sampling |
| 12 | skip-list | Skip List |
| 13 | treap-probabilistic | Treap |
| 14 | randomized-meldable-heap | Randomized Meldable Heap |
| 15 | probabilistic-invariant-check | Probabilistic Invariant Check |