Probabilistic data structures in Go
Comments
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Summary
The article introduces "unsure", a Go package of probabilistic data structures (Bloom filter, count-min sketch, HyperLogLog, T-digest, top-k), with the author explaining how these trade exact answers for much lower memory use.