MinHash, LSH, LSH Forest, Weighted MinHash, HyperLogLog, HyperLogLog++, LSH Ensemble

Fast Web log analyzer using probabilistic data structures

Yet another distributed fault-tolerant key-value database Compatible with Redis written in Golang.

HyperMinHash: Bringing intersections to HyperLogLog

Distributed caching based on StackExchange.Redis and Redis. Includes support for tagging and is cluster-compatible.

Sketching Algorithms for Clojure (bloom filter, min-hash, hyper-loglog, count-min sketch)

Fast and accurate genomic distances using HyperLogLog

C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash

Python HyperLogLog written in C.

Yet another distributed kvstore support redis data and index. moved to: https://github.com/youzan/ZanRedisDB

Estimating k-mer coverage histogram of genomics data

A probabilistic data structures library for C#

HyperLogLog cardinality estimation algorithm in go/golang!

Paper about the estimation of cardinalities from HyperLogLog sketches

Probabilistic data structures for OCaml

Union, intersection, and set cardinality in loglog space

Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.

A HyperLogLog implementation in Rust.

go patterns

HyperLogLog in golang

HyperLogLog for PHP implemented as a C extension

Unique site visits counter in Go

HyperLogLog and other probabilistic data structures for mining in data streams

A simple, time-tested, family of random hash functions in Java, based on CRC32, affine transformations, and the Mersenne Twister. 🎲

Go implementation of Hyper Log Log

Redis compatible HyperLogLog implementation in Elixir

In-memory Pure Java implementation to Redis useful for unit testing

Spark with probabilistic algortighmts - Bloom filter, HLL, QTree and Count-min sketch

A header-only bit vector library for C . This can be used for implementing dynamic bit-vectors for building Bloom-Filters and Hyper-Logs .