IEICE TRANSACTIONS on Communications
Asymmetric Sparse Bloom Filter
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E97-B No.4 pp.765-772
- Publication Date
- 2014/04/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E97.B.765
- Type of Manuscript
- PAPER
- Category
- Internet
Authors
MyungKeun YOON
Kookmin University
JinWoo SON
Kookmin University
Seon-Ho SHIN
Kookmin University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
MyungKeun YOON, JinWoo SON, Seon-Ho SHIN, "Asymmetric Sparse Bloom Filter" in IEICE TRANSACTIONS on Communications,
vol. E97-B, no. 4, pp. 765-772, April 2014, doi: 10.1587/transcom.E97.B.765.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E97.B.765/_p
Copy
@ARTICLE{e97-b_4_765,
author={MyungKeun YOON, JinWoo SON, Seon-Ho SHIN, },
journal={IEICE TRANSACTIONS on Communications},
title={Asymmetric Sparse Bloom Filter},
year={2014},
volume={E97-B},
number={4},
pages={765-772},
abstract={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.},
keywords={},
doi={10.1587/transcom.E97.B.765},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - Asymmetric Sparse Bloom Filter
T2 - IEICE TRANSACTIONS on Communications
SP - 765
EP - 772
AU - MyungKeun YOON
AU - JinWoo SON
AU - Seon-Ho SHIN
PY - 2014
DO - 10.1587/transcom.E97.B.765
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E97-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2014
AB - 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.
ER -
English
