Cuckoo filters and their analysis: 11011110Do you have a software project in which you need a fast and space-efficient approximate set data structure, like a Bloom filter ? Then probably what you want is actually a cuckoo filter , a plug-in replacement for Bloom filters that is faster, more space-efficient, and more versatile (because it allows elements to be deleted as well as inserted). Michael Mitzenmacher has described cuckoo filters i
https://www.cs.cmu.edu/~binfan/papers/login_cuckoofilter.pdf
