Probabilistic data structures in Go
0 comments · go
- Comments12
0 comments · go
Story details from Lobsters ↗ · linked article on antonz.org.
Probabilistic data structures in Go was first seen on Lobsters · Hottest on Nov 13, 2026. Since then it has appeared in 109 checks on 3 different days. Its best position was #4 of 25, reached on Nov 13, 21:51 UTC. It dropped off the list after Nov 15, 22:51 UTC.
Position on Lobsters · Hottest at every check (lower is better).
Best rank per day (UTC).
Platform metric as reported by Lobsters.
A few top-level comments from Lobsters, shortened. Read the full thread on Lobsters.
There’s a relatively new and simpler alternative to HyperLogLog for cardinality estimation that Knuth called the CVM algorithm (after its authors) https://buttondown.com/jaffray/archive/the-cvm-algorithm/
When I investigated quantile statistics a few years ago, I came to the conclusion that a histogram with log-linear bucketing is much simpler to implement than a T-digest, and more useful and easier to understand from an operational point of view. Log-linear bucketing corresponds to the kind of scientific notation…
These are so cool! I know Bloom filters, so thank you for introducing me to the others.
Archived daily, weekly and monthly lists that include this entry.
Not at the moment. It was last on the list on Nov 15, 22:51 UTC, after 3 days of trending.
#4 on Lobsters · Hottest, on Nov 13, 21:51 UTC. Trendoday checks this list every 30 minutes.
It was first seen on Nov 13, 2026 and has been on the list on 3 days (109 checks) since.