There are 7 repositories under probabilistic-data-structures topic.
Hashing-function agnostic Cuckoo filters for Redis
Simple probabilistic data structures
A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.
Cuckoo Filter: Practically better than bloom filter
A probabilistic data structures library for C#
Production-ready Cuckoo Filters for any C ABI compatible target.
Bloomfilter written in Golang, includes rotation and RPC
Erlang nif for xor_filter. 'Faster and Smaller Than Bloom and Cuckoo Filters'.
Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)
🦀 Bloom filter implementation in Rust 🦀
Production-ready Java implementation of the Xor Filter.
Exploring Probabilistic Data Structures in Python - my 2021 Pycon USA and Australia and Pycon MEA 2022 talk.
Erlang NIF for Binary Fuse Filter. Fast and Smaller Than Xor Filters.
An implementation of the Bloom filter data structure conforming to Swift's Codable serialization protocol
HyperLogLog++ Implementation with C++14
BuildX PDSA - A build_x project on Probabilistic Data Structures in Rust
Repository for an article series on probabilistic data structures including Skiplist, bloom filter, counting bloom filter, count sketch, count min sketch etc
Teaching tool for explaining TopK Theta Sketches and TopK Tuple Sketches
Bloom filter library written in Python
A Bloom filter implementation in Go