MinHash, LSH, LSH Forest, Weighted MinHash, HyperLogLog, HyperLogLog++, LSH Ensemble and HNSW
Dynatrace hash library for Java
A Clojure library for querying large data-sets on similarity
Paper about the estimation of cardinalities from HyperLogLog sketches
DynaHist: A Dynamic Histogram Library for Java
Routines and data structures for using isarn-sketches idiomatically in Apache Spark
Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)
Production-grade streaming data sketching algorithms for Elixir.
Implementation for - Mitigating DNS random subdomain DDoS attacks by distinct heavy hitters sketches
ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale
UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
Approximate Sketches for Join Size Estimation (SIGMOD'24)
Probabilistic data structures for JavaScript and TypeScript: Bloom filter (scalable, blocked), Cuckoo filter, Binary Fuse filter (an xor filter), HyperLogLog, Theta sketch, Count-Min sketch, Top-K, KLL sketch, DDSketch quantile sketch, MinHash and RIBLT set reconciliation. Zero dependencies.
High-integrity Python KLL sketch for streaming quantiles — mergeable, deterministic, zero-dependency, with optional C++17/SIMD acceleration.
Yet Another Lame Algorithm Library
A Prototype For Fitting Monotonic Cubic Splines to a Tdigest Sketch
A barebones implementation of the simhash data sketching algorithm.
To associate your repository with the data-sketches topic, visit your repo's landing page and select "manage topics."