Cuckoo Filter: Simplification and Analysis

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 l...

Full description

Bibliographic Details
Main Author: Eppstein, David
Format: Report
Language:unknown
Published: arXiv 2016
Subjects:
Data Structures and Algorithms cs.DS
FOS Computer and information sciences
F.2.2
Iceland
Online Access:https://dx.doi.org/10.48550/arxiv.1604.06067
https://arxiv.org/abs/1604.06067
id ftdatacite:10.48550/arxiv.1604.06067
record_format openpolar
spelling ftdatacite:10.48550/arxiv.1604.06067 2023-05-15T16:49:00+02:00 Cuckoo Filter: Simplification and Analysis Eppstein, David 2016 https://dx.doi.org/10.48550/arxiv.1604.06067 https://arxiv.org/abs/1604.06067 unknown arXiv Creative Commons Attribution 4.0 International https://creativecommons.org/licenses/by/4.0/legalcode cc-by-4.0 CC-BY Data Structures and Algorithms cs.DS FOS Computer and information sciences F.2.2 Preprint Article article CreativeWork 2016 ftdatacite https://doi.org/10.48550/arxiv.1604.06067 2022-04-01T11:34:15Z 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. : 12 pages, 1 figure. To appear at the 15th Scandinavian Symposium and Workshops on Algorithm Theory, June 22-24, 2016, Reykjavik, Iceland Report Iceland DataCite Metadata Store (German National Library of Science and Technology)
institution Open Polar
collection DataCite Metadata Store (German National Library of Science and Technology)
op_collection_id ftdatacite
language unknown
topic Data Structures and Algorithms cs.DS
FOS Computer and information sciences
F.2.2
spellingShingle Data Structures and Algorithms cs.DS
FOS Computer and information sciences
F.2.2
Eppstein, David
Cuckoo Filter: Simplification and Analysis
topic_facet Data Structures and Algorithms cs.DS
FOS Computer and information sciences
F.2.2
description 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. : 12 pages, 1 figure. To appear at the 15th Scandinavian Symposium and Workshops on Algorithm Theory, June 22-24, 2016, Reykjavik, Iceland
format Report
author Eppstein, David
author_facet Eppstein, David
author_sort Eppstein, David
title Cuckoo Filter: Simplification and Analysis
title_short Cuckoo Filter: Simplification and Analysis
title_full Cuckoo Filter: Simplification and Analysis
title_fullStr Cuckoo Filter: Simplification and Analysis
title_full_unstemmed Cuckoo Filter: Simplification and Analysis
title_sort cuckoo filter: simplification and analysis
publisher arXiv
publishDate 2016
url https://dx.doi.org/10.48550/arxiv.1604.06067
https://arxiv.org/abs/1604.06067
genre Iceland
genre_facet Iceland
op_rights Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
cc-by-4.0
op_rightsnorm CC-BY
op_doi https://doi.org/10.48550/arxiv.1604.06067
_version_ 1766039064635506688

Similar Items