For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Asymmetric Sparse Bloom Filter
MyungKeun YOON JinWoo SON Seon-Ho SHIN
IEICE TRANSACTIONS on Communications
Publication Date: 2014/04/01
Online ISSN: 1745-1345
Type of Manuscript: PAPER
Bloom filter, membership testing, string matching, virus scanning,
Full Text: PDF>>
We propose a new Bloom filter that efficiently filters out non-members. With extra bits assigned and asymmetrically distributed, the new filter reduces hash computations and memory accesses. For an error rate of 10-6, the new filter reduces cost by 31.31% with 4.33% additional space, while the standard method saves offers a 20.42% reduction.