【2017年整理】4种计数型BloomFilter的性能分析与比较.pdfVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.21, No.5, May 2010, pp.1098− 1114 doi: 10.3724/SP.J.1001.2010.03495 Tel/Fax: +86-10 © by Institute of Software , the Chinese Academy of Sciences . All rights reserved. ∗ 4 种计数型 Bloom Filter 的性能分析与比较 + 张 进 , 邬江兴, 刘勤让 ( 国家数字交换系统工程技术研究中心,河南 郑州 450002) Performance Evaluation and Comparison of Four Counting Bloom Filter Schemes + ZHANG Jin , WU Jiang-Xing, LIU Qin-Rang (National Digital Switching System Engineering Technology Research Center, Zhengzhou 450002, China) + Corresponding author: E-mail: boost_zj@163.com Zhang J, Wu JX, Liu QR. Performance evaluation and comparison of four counting bloom filter schemes. Journal of Software, 2010,21(5):1098−1114. /1000-9825/3495.htm Abstract : The Counting Bloom Filter (CBF) is a space-efficient data structure that extends a Bloom filter so as to allow approximate multiplicity queries on a dynamic multi-set. An in-depth study of three existing CBF schemes is presented, that is, the Naïve Counting Bloom Filter (NCBF), the Space-Code Bloom Filter (SCBF) and the d-left Counting Bloom Filter (dlCBF). Then, a CBF scheme called Binary Shrinking d-left Counting Bloom Filter (BSdlCBF) is proposed. A performance metrics named load adaptability for CBF schemes is also defined. The performance of the four CBF schemes is evaluated by using metrics of counting error, space complexity and load adaptability under both uniform and Zipfian multiplicity distributions. The experimental results show that the proposed BSdlCBF outperforms the other three