View : 708 Download: 0

Cuckoo bloom filter

Title
Cuckoo bloom filter
Authors
Mun J.H.Lim H.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2019
Journal Title
ICEIC 2019 - International Conference on Electronics, Information, and Communication
Citation
ICEIC 2019 - International Conference on Electronics, Information, and Communication
Publisher
Institute of Electrical and Electronics Engineers Inc.
Indexed
SCOPUS scopus
Document Type
Conference Paper
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. © 2019 Institute of Electronics and Information Engineers (IEIE).
DOI
10.23919/ELINFOCOM.2019.8706343
ISBN
9788995004449
Appears in Collections:
공과대학 > 전자전기공학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE