Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SWAT.2016.8
URN: urn:nbn:de:0030-drops-60264
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6026/
Eppstein, David
Cuckoo Filter: Simplification and Analysis
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{eppstein:LIPIcs:2016:6026,
author = {David Eppstein},
title = {{Cuckoo Filter: Simplification and Analysis}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {8:1--8:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Rasmus Pagh},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6026},
URN = {urn:nbn:de:0030-drops-60264},
doi = {10.4230/LIPIcs.SWAT.2016.8},
annote = {Keywords: approximate set, Bloom filter, cuckoo filter, cuckoo hashing}
}
| Keywords: | approximate set, Bloom filter, cuckoo filter, cuckoo hashing | |
| Seminar: | 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 22.06.2016 |
