hyperloglog topic
dashing
Fast and accurate genomic distances using HyperLogLog
logswan
Fast Web log analyzer using probabilistic data structures
flajolet
Probabilistic data structures for OCaml
wyHLL
The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
bloom-filters
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
CachingFramework.Redis
Distributed caching based on StackExchange.Redis and Redis. Includes support for tagging and is cluster-compatible.
datasketch
MinHash, LSH, LSH Forest, Weighted MinHash, HyperLogLog, HyperLogLog++, LSH Ensemble and HNSW
sketchy
Sketching Algorithms for Clojure (bloom filter, min-hash, hyper-loglog, count-min sketch)
sketch
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
hyperminhash
HyperMinHash: Bringing intersections to HyperLogLog