Bloom filter optimization using Cuckoo Search

作者: Arulanand Natarajan , S Subramanian

DOI: 10.1109/ICCCI.2012.6158857

关键词:

摘要: Bloom Filter (BF) is a simple but powerful data structure that can check membership to static set. The trade-off use filter certain configurable risk of false positives. odds positive be made very low if the hash bitmap sufficiently large. Bin (BBF) has number BFs with different rates based on their significance. Cuckoo Search (CS) employed assign which minimize total invalidation cost. experimental results have demonstrated for spam filtering using CS various numbers bins.

参考文章(25)
Peter C. Dillinger, Panagiotis Manolios, Bloom Filters in Probabilistic Verification formal methods in computer aided design. pp. 367- 381 ,(2004) , 10.1007/978-3-540-30494-4_26
Guy M. Lohman, Lothar F. Mackert, R* Optimizer Validation and Performance Evaluation for Distributed Queries very large data bases. pp. 537- 547 ,(1994)
Xin-She Yang, Suash Deb, Cuckoo Search via Lévy flights nature and biologically inspired computing. pp. 210- 214 ,(2009) , 10.1109/NABIC.2009.5393690
Andrei Broder, Michael Mitzenmacher, Network Applications of Bloom Filters: A Survey Internet Mathematics. ,vol. 1, pp. 485- 509 ,(2004) , 10.1080/15427951.2004.10129096
Kun Xie, Yinghua Min, Dafang Zhang, Gaogang Xie, Jigang Wen, Basket Bloom Filters for Membership Queries ieee region 10 conference. pp. 1- 6 ,(2005) , 10.1109/TENCON.2005.301258
Amin Vahdat, Patrick Reynolds, Efficient peer-to-peer keyword searching acm ifip usenix international conference on middleware. pp. 21- 40 ,(2003) , 10.5555/1515915.1515918
Fang Hao, Murali Kodialam, T. V. Lakshman, Building high accuracy bloom filters using partitioned hashing measurement and modeling of computer systems. ,vol. 35, pp. 277- 288 ,(2007) , 10.1145/1254882.1254916
Saar Cohen, Yossi Matias, Spectral bloom filters international conference on management of data. pp. 241- 252 ,(2003) , 10.1145/872757.872787
Ronitt Rubinfeld, Bernard Chazelle, Joe Kilian, Ayellet Tal, The Bloomier filter: an efficient data structure for static support lookup tables symposium on discrete algorithms. pp. 30- 39 ,(2004) , 10.5555/982792.982797
Fan Deng, Davood Rafiei, Approximately detecting duplicates for streaming data using stable bloom filters international conference on management of data. pp. 25- 36 ,(2006) , 10.1145/1142473.1142477