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
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现,优于布隆过滤器,可以定制化过滤器参数,并进行了空间优化
Hashing-function agnostic Cuckoo filters for Redis
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.
A probabilistic data structures library for C#
Prefix Filter: Practically and Theoretically Better Than Bloom.
High-performance, concurrent, and mutable Cuckoo Filter for Erlang and Elixir