Cuckoo Filter: Simplification and Analysis

David Eppstein, Marc Herbstritt
2016 Scandinavian Workshop on Algorithm Theory  
The cuckoo filter data structure of Fan, Andersen, Kaminsky, and Mitzenmacher (CoNEXT 2014) performs the same approximate set operations as a Bloom filter in less memory, with better locality of reference, and adds the ability to delete elements as well as to insert them. However, until now it has lacked theoretical guarantees on its performance. We describe a simplified version of the cuckoo filter using fewer hash function calls per query. With this simplification, we provide the first
more » ... ical performance guarantees on cuckoo filters, showing that they succeed with high probability whenever their fingerprint length is large enough.
doi:10.4230/lipics.swat.2016.8 dblp:conf/swat/Eppstein16 fatcat:ba5vszkmj5gvvmruweumoxhtyq