Probabilistic data structures for processing continuous, unbounded streams.
Cuckoo Filter implementation in Go, better than Bloom Filters (unmaintained)
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现,优于布隆过滤器,可以定制化过滤器参数,并进行了空间优化
Implementing a Cuckoo filter, based on the paper Cuckoo Filter: Practically Better Than Bloom
A fast, vectorized Cuckoo filter implementation in Go. Zero allocations in hot paths with zero-copy binary representation.
Thread-safe and persistent Golang implementations of probabilistic data structures: Bloom Filter, Cuckoo Filter, HyperLogLog, Count-Min Sketch and Top-K
Probabilistic data structures implemented in Go.