From the archive
Friday, 13 November
Folded from 18 sources that day.
Sorted by quality and by how many sources covered it, the same for everyone.
-
Probabilistic data structures in Go
Explains Bloom filters, count-min sketches, HyperLogLog, t-digest and top-k, and their memory-accuracy trade-offs. Introduces the dependency-free unsure Go package, where a 1% Bloom filter is about 50 times smaller than a set.