Cuckoo bloom filter

Ju Hyoung Mun, Hyesook Lim

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

A membership identification is a key functionality in many network applications. Various data structures have been introduced in order to support the efficient membership identification. Since a Bloom filter can provide simple but efficient membership checking, it is widely used in many network applications. However, the query results of Bloom filters can have false positives, which can degrade the search performance. Thus, reducing false positives of Bloom filters is challenging. In order to reduce the false positive rate, this paper proposes to use two sets of hash functions: primary and secondary. When the cell referenced by the primary hash function is occupied, the value of that cell is relocated to a cell referenced by the secondary hash functions like in the cuckoo hash. The proposed structure is evaluated using various sets, and the simulation results show that the proposed scheme can reduce the false positive rates.

Original languageEnglish
Title of host publicationICEIC 2019 - International Conference on Electronics, Information, and Communication
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9788995004449
DOIs
StatePublished - 3 May 2019
Event18th International Conference on Electronics, Information, and Communication, ICEIC 2019 - Auckland, New Zealand
Duration: 22 Jan 201925 Jan 2019

Publication series

NameICEIC 2019 - International Conference on Electronics, Information, and Communication

Conference

Conference18th International Conference on Electronics, Information, and Communication, ICEIC 2019
Country/TerritoryNew Zealand
CityAuckland
Period22/01/1925/01/19

Fingerprint

Dive into the research topics of 'Cuckoo bloom filter'. Together they form a unique fingerprint.

Cite this