Submission timeline
2007–2026One slot for every year since HN launched. Height is that year's peak points; orange marks a 100+ point or 50+ comment breakout. Select a bar to open its strongest thread.
First comments on top threads
HN comment orderCuckoo filter is used in the upcoming Cache Digest HTTP Standard: > HTTP/2 frame type to allow clients to inform the server of their cache’s contents. Servers can then use this to inform their choices of what to push to clients. http://httpwg.org/http-extensions/draft-ietf-httpbis-cache-d... https://github.com/httpwg/http-extensions/pull/413
I've given a talk at Papers We Love about Bloom Filters (http://paperswelove.org/2015/video/armon-dadgar-on-bloom-fil...) for those wanting to learn more. There have been quite a few follow on extensions to standard bloom filters that address some of the shortcomings mentioned here. For example, the cost of having K hash functions can be avoided with some simple math. This is discussed in "Less Hashing, Same Performance" (http://www.eecs.harvard.edu/%7Ekirsch/pubs/bbbf/esa06.pdf). You can also avoid the FPP rate…
The first top-level comment from each of the four biggest threads, in HN’s own order. Excerpts are shortened; open a comment for full context.
- Breakout years
- 2
- Total points
- 380
- Total comments
- 54
100+ points or 50+ comments
reference only — not used in Hall rules or ranking
reference only — not used in Hall rules or ranking
Every submission
| Date | Title as submitted | By | Points | Comments |
|---|---|---|---|---|
| 2016-07-19 | Probabilistic Filters By Example: Cuckoo Filter and Bloom FiltersFirst breakout | rpcope1 | 134 | 25 |
| 2018-03-28 | Probabilistic Filters By ExampleBest thread · Latest 20+ point return | PokemonNoGo | 227 | 29 |
| 2023-01-22 | Probabilistic Filters by Example | avinassh | 2 | 0 |
| 2024-05-23 | Probabilistic Filters by Example | klaussilveira | 16 | 0 |
| 2024-07-11 | Probabilistic Filters by Example | IdealeZahlen | 1 | 0 |