efficient/cuckoofilter

Health v2 · maintenance only

Flags: no_releases no_license

Adoption not part of the score

1012 stars · 175 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

A C++ library implementing cuckoo filters, a space-efficient probabilistic data structure for approximate set-membership queries that supports deletion, serving as a Bloom filter replacement. It is based on cuckoo hashing and stores key fingerprints, achieving compact space at low false positive rates.

Use cases

• check if an item is probably in a set without storing the full set
• replace a Bloom filter when items need to be deleted
• build a space-efficient membership filter with low false positive rate
• track seen items in a stream with dynamic add and remove
• benchmark probabilistic filters for speed and space

When to choose

• you need deletions from an approximate membership structure without counting Bloom filter overhead
• you need low false positive rates (<3%) with compact memory usage
• you are working in C++ and want a small, benchmarked filter implementation

When to avoid

• you need exact membership answers with zero false positives
• you need a Bloom filter in another language or with bindings
• your false positive tolerance is high and a simpler Bloom filter suffices
• you need an actively maintained project with recent releases

Facets

library · maturity maintenance

search-engine caching developer-tools databases performance developer-tools cpp cross-platform windows cuckoo-filter bloom-filter probabilistic-data-structure set-membership header-only algorithms linux macos

Member repositories

For agents

markdown · JSON · MCP: product_card(name="efficient/cuckoofilter")