Hashing-function agnostic Cuckoo filters for Redis

Simple probabilistic data structures

Probabilistic Data Structures and Algorithms in Python

🌺 A pure Elixir implementation of Scalable Bloom Filters

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

Bloomfilter written in Golang, includes rotation and RPC

A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)

Production-ready Cuckoo Filters for any C ABI compatible target.

Cuckoo Filter: Practically better than bloom filter

A probabilistic data structures library for C#

🐦 Cuckoo Filters in Elixir

Fast Bloom filter with concurrent accessibility, powered by :atomics module.

An in-memory bloom filter with persistence and HTTP interface

Erlang nif for xor_filter. 'Faster and Smaller Than Bloom and Cuckoo Filters'.

Probabilistic Data Structure Template Library

A Go implementation of an in-memory bloom filter, with support for boltdb and badgerdb as optional data persistent storage.

A family of randomized, history-independent search tree data structures

Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)

🦀 Bloom filter implementation in Rust 🦀

Production-ready Java implementation of the Xor Filter.