Interesting Esoterica

Cuckoo Filter: Simplification and Analysis

Article by David Eppstein
  • Published in 2016
  • Added on
In the collections
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 theoretical performance guarantees on cuckoo filters, showing that they succeed with high probability whenever their fingerprint length is large enough.

Links


BibTeX entry

@article{CuckooFilterSimplificationandAnalysis,
	title = {Cuckoo Filter: Simplification and Analysis},
	abstract = {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 theoretical performance guarantees on
cuckoo filters, showing that they succeed with high probability whenever their
fingerprint length is large enough.},
	url = {http://arxiv.org/abs/1604.06067v1 http://arxiv.org/pdf/1604.06067v1},
	author = {David Eppstein},
	comment = {},
	urldate = {2017-05-23},
	archivePrefix = {arXiv},
	eprint = {1604.06067},
	primaryClass = {cs.DS},
	year = 2016,
	collections = {animals,basically-computer-science}
}