Probabilistic data structures for processing continuous, unbounded streams.

Cuckoo Filter implementation in Go, better than Bloom Filters (unmaintained)

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

Substitute for bloom filter.

Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化

Hashing-function agnostic Cuckoo filters for Redis

高性能的分布式的专门空间优化的 Bitmap 服务, 高效检查数据是否存在,日活统计，签到，打点等等

Cuckoo Index: A Lightweight Secondary Index Structure

Pure Ruby Cuckoo Filter Implementation

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

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#

Probabilistic data structures for Guava.

Prefix Filter: Practically and Theoretically Better Than Bloom.

High-performance, concurrent, and mutable Cuckoo Filter for Erlang and Elixir

🐦 Cuckoo Filters in Elixir

Optimized implementation of Cuckoo Filter: Practically Better Than Bloom.

Scalable Cuckoo filter