bdupras.github.io personal blog
Probabilistic Filters By Example
Probablistic filters are high-speed, space-efficient data structures that support set-membership tests with a one-sided error. These filters can claim that a given entry is definitely not represented in a set of entries, or might be represented in the set. That is, negative responses are conclusive, whereas positive…
- Points
- 227
- HN comments
- 54
- Submissions
- 2
- Cited by
- 4 commenters
Math & AlgorithmsSoftware Engineering2018
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Mar 28, 2018 | Probabilistic Filters By Example by PokemonNoGo | 227 | 29 |
| Jul 19, 2016 | Probabilistic Filters By Example: Cuckoo Filter and Bloom Filters by rpcope1 | 134 | 25 |
Cited in comments
Linked from 4 Hacker News comments by 4 different people, from Aug 2016 to Jul 2025.
Most recent:
- mariusor · Jul 1, 2025
- avmich · Sep 7, 2017
- orthoganol · Jul 4, 2017
- bradleyjg · Aug 5, 2016
