Paket: golang-github-seiflotfy-cuckoofilter-dev (0.0~git20201222.bc60055-1)

Bloom filter replacement using cuckoo hashing

Cuckoo filter is a Bloom filter replacement for approximated set-membership queries. While Bloom filters are well-known space-efficient data structures to serve queries like "if item x is in a set?", they do not support deletion. Their variances to enable deletion (like counting Bloom filters) usually require much more space.

Cuckoo filters provide the flexibility to add and remove items dynamically. A cuckoo filter is based on cuckoo hashing (and therefore named as cuckoo filter). It is essentially a cuckoo hash table storing each key's fingerprint. Cuckoo hash tables can be highly compact, thus a cuckoo filter could use less space than conventional Bloom filters, for applications that require low false positive rates (< 3%).

Bu sayfa aynı zamanda aşağıdaki dillerde de kullanılabilir (Öntanımlı belge dili nasıl ayarlanır):