View : 156 Download: 0

Ternary Bloom Filter Replacing Counting Bloom Filter

Title
Ternary Bloom Filter Replacing Counting Bloom Filter
Authors
Lim, HyesookLee, JungwonByun, HayoungYim, Changhoon
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2017
Journal Title
IEEE COMMUNICATIONS LETTERS
ISSN
1089-7798JCR Link1558-2558JCR Link
Citation
vol. 21, no. 2, pp. 278 - 281
Keywords
Bloom filtercounting Bloom filterternary Bloom filterfalse positive rate
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Indexed
SCI; SCIE; SCOPUS WOS
Abstract
A counting Bloom filter (CBF) is commonly used in many applications for the membership queries of dynamic data since the CBF can provide delete operations. A CBF uses an array of c-bit counters. The c should be large enough to avoid overflows. In this letter, we propose an alternative to CBF, named ternary Bloom filter (TBF) for performance improvement. The proposed TBF allocates the minimum number of bits to each counter and includes more number of counters instead to reduce false positive probability. We present a mathematical analysis and experimental results for a set of performance measures. When the TBF consumes the same amount of memory as the CBF, the TBF provides much lower false positive rates than the CBF.
DOI
10.1109/LCOMM.2016.2624286
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