View : 409 Download: 0

A circled Bloom filter for the membership identification of multiple sets

Title
A circled Bloom filter for the membership identification of multiple sets
Authors
Lee J.Lim H.
Ewha Authors
임혜숙이정원
SCOPUS Author ID
임혜숙scopus; 이정원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
Keywords
Bloom filterCircleDouble-meaningIntersection
Publisher
Institute of Electrical and Electronics Engineers Inc.
Indexed
SCOPUS scopus
Document Type
Conference Paper
Abstract
A Bloom filter is a simple data structure that identifies the membership of an input against a given set. Various types of Bloom filters have been widely used in recent years. While standard Bloom filters only provide the membership identification of a given set by storing a value of 0 or 1 in a cell, we propose to provide the membership information of multiple sets through a single Bloom filter by storing different values in a cell. In other words, if two different sets are given, the proposed Bloom filter structure allocates 2 bits in one cell, and two different values indicating each set are specified in advance to program the sets. Hence the proposed Bloom filter structure accurately determines the membership of each set and the intersection of two sets by querying a single Bloom filter. In addition, we propose a circled Bloom filter structure to improve the accuracy of the membership identification. Experimental results show that the proposed Bloom filter structure provides the better accuracy with using the half of querying operations compared to two separate Bloom filter structure. © 2019 Institute of Electronics and Information Engineers (IEIE).
Show the fulltext
DOI
10.23919/ELINFOCOM.2019.8706480
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

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE