We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Approaches for Improving Bloom Filter-Based Set Membership Query.
- Authors
HyunYong Lee; Byung-Tak Lee
- 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%.
- Publication
Journal of Information Processing Systems, 2019, Vol 15, Issue 3, p550
- ISSN
1976-913X
- Publication type
Article
- DOI
10.3745/JIPS.04.0116