unsure
4 articles in the last 30 days.
-
Probabilistic data structures in Go, part 2
Covers binary fuse filters, UltraLogLog, log-linear histograms and MinHash with the unsure package, comparing each with Bloom filters and HyperLogLog.
-
Probabilistic data structures in Go, part 2
Covers binary fuse filters, UltraLogLog, log-linear histograms and MinHash with the unsure Go package. It compares their memory use and error guarantees with Bloom filters.
-
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.
-
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.