MinHash, LSH, LSH Forest, Weighted MinHash, HyperLogLog, HyperLogLog++, LSH Ensemble and HNSW
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Yet another distributed fault-tolerant key-value database Compatible with Redis written in Golang.
Fast Web log analyzer using probabilistic data structures
Distributed caching based on StackExchange.Redis and Redis. Includes support for tagging and is cluster-compatible.
Hyper LogLog (native and sliding) cardinality counters
Fast and accurate genomic distances using HyperLogLog
Dynatrace hash library for Java
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
Sketching Algorithms for Clojure (bloom filter, min-hash, hyper-loglog, count-min sketch)
Fast HyperLogLog for Python.
Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.
A probabilistic data structures library for C#
Estimating k-mer coverage histogram of genomics data
Yet another distributed fault-tolerant key-value database Compatible with Redis written in Golang.
Rust's fastest and most accurate cardinality estimators.
Paper about the estimation of cardinalities from HyperLogLog sketches
HyperLogLog cardinality estimation algorithm in go/golang!