View : 64 Download: 0

Complement bloom filter for identifying true positiveness of a bloom filter

Title
Complement bloom filter for identifying true positiveness of a bloom filter
Authors
Lim H.Lee J.Yim C.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2015
Journal Title
IEEE Communications Letters
ISSN
1089-7798JCR Link
Citation
vol. 19, no. 11, pp. 1905 - 1908
Keywords
Bloom filtercomplement Bloom filterfalse positivenegativetrue positive
Publisher
Institute of Electrical and Electronics Engineers Inc.
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
The use of Bloom filters in network applications has increased rapidly. Since Bloom filters can produce false positives, the trueness of each positive needs to be identified by referring to an off-chip hash table. This letter proposes a new method for identifying the trueness of Bloom filter positives. We propose the use of an additional Bloom filter programmed for the complement set of the given set. In querying an input, if the complement Bloom filter produces a negative result, the input is a member of the given set since Bloom filters never produce a false negative. When both Bloom filters produce positives, a hash table needs to be referred to in our method. We provide a mathematical analysis, whereby the probability of referring to a hash table converges to the summation of the false positive probabilities of each Bloom filter. We provide the simulation result that the rate of referring to a hash table in our method is the order of 10-5 for Bloom filter sizing factor 32. © 2015 IEEE.
DOI
10.1109/LCOMM.2015.2478462
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