In-memory nucleotide sequence k-mer counting, filtering, graph traversal and more

Probabilistic data structures for processing continuous, unbounded streams.

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

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

A probabilistic data structures library for C#

Count-Min Sketch Implementation in C

A compressed adaptive optimizer for training large-scale deep learning models using PyTorch

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

A class library implementing probabilistic data structures in .NET

Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html

🎛️ Use RedisBloom in PHP!

An implementation of Count-Min Sketch in Golang

go patterns

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

PHP client for RedisBloom module

Pond is a high performance object-pooling library for Python

CountMin sketching algorithm in golang

Count-Min Sketch

Data Pipelines and Sketchy Data Structures for Sub-Linear Retrievals