cuckoofilter
A space-efficient probabilistic data structure for set membership queries that supports dynamic additions and deletions.
What is cuckoofilter?
Cuckoo Filter is a probabilistic data structure that provides approximated set-membership queries, answering "if item x is in a set?" with a known false positive rate. It improves upon Bloom filters by supporting dynamic addition and deletion of items while maintaining space efficiency, especially at low false positive rates (<3%). The implementation uses cuckoo hashing to store compact fingerprints in buckets.
Developers and engineers building systems that require efficient set membership testing with mutable datasets, such as databases, network routers, caching layers, or applications needing duplicate detection.
It offers a practical alternative to Bloom filters by enabling item deletion without the space overhead of counting Bloom filters, and it can be more compact for low false positive rates, making it ideal for applications where datasets change dynamically.
Overview
Cuckoo Filter: Practically Better Than Bloom
Use Cases
Best For
- Implementing duplicate detection in streaming data pipelines
Related Projects
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
