ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Journal Article Approaches for Improving Bloom Filter-Based Set Membership Query
Cited 2 time in scopus Share share facebook twitter linkedin kakaostory
Authors
HyunYong Lee, Byung-Tak Lee
Issue Date
2019-06
Citation
Journal of Information Processing Systems, v.15, no.3, pp.550-569
ISSN
1976-913X
Publisher
한국정보처리학회 (KIPS)
Language
English
Type
Journal Article
DOI
https://dx.doi.org/10.3745/JIPS.04.0116
Abstract
We propose approaches for improving Bloom filter in terms of false positive probability and membership query speed. To reduce the false positive probability, we propose special type of additional Bloom filters that are used to handle false positives caused by the original Bloom filter. Implementing the proposed approach for a routing table lookup, we show that our approach reduces the routing table lookup time by up to 28% compared to the original Bloom filter by handling most false positives within the fast memory. We also introduce an approach for improving the membership query speed. Taking the hash table-like approach while storing only values, the proposed approach shows much faster membership query speed than the original Bloom filter (e.g., 34 times faster with 10 subsets). Even compared to a hash table, our approach reduces the routing table lookup time by up to 58%.
KSP Keywords
False Positive(FP), Filter-based, Hash table, Routing table lookup, Set membership, Table-like, bloom filter, membership query