Bloom filter optimization using Cuckoo Search

2012 International Conference on Computer Communication and Informatics, ICCCI 2012

Volumn , Issue , 2012, Pages

  Natarajan, Arulanand ^a   Subramanian, S ^b  

^a ANNA UNIVERSITY   (India)

^b SRI KRISHNA COLLEGE OF ENGINEERING AND TECHNOLOGY   (India)

Author keywords

Bin Bloom Filter; Bloom Filter; Cuckoo Search; False positive rate; Hash function; Spam word

Indexed keywords

BLOOM FILTERS; CONFIGURABLE; CUCKOO SEARCHES; FALSE POSITIVE; FALSE POSITIVE RATES; SPAM FILTERING; SPAM WORD;

BINS; COMMUNICATION; DATA STRUCTURES; HASH FUNCTIONS; INFORMATION SCIENCE; INTERNET;

BLOOMS (METAL);

EID: 84858736682     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCI.2012.6158857     Document Type: Conference Paper

References (28)

1. Bloom B, Space/time tradeoffs in hash coding with allowable errors, Communications of the ACM, 13, 1970, 422-426.
2. Feng W,Shin K.G, Kandlur D.D. & D.Saha, "The BLUE active queue management algorithms", IEEE/ACM Transactions on Networking, 10, 2002, 513-528. (Pubitemid 35000394)
3. Mullin J.K, Optimal Semijoins for Distributed Database Systems, IEEE Trans. Software Eng., 16, 1990, 558-560.
4. Mackert L.F. and Lohman G.M., Optimizer Validation and Performance Evaluation for Distributed Queries, Proc. 12th Int'l Conf. Very Large Data Bases (VLDB), 1986, 149-159.
5. Broder A and Mitzenmacher M. Network Applications of Bloom Filters: A Survey, Internet Math., 1(4), 2005, 485-509.
6. Kubiatowicz J Bindel D, Chen, Y Czerwinski S, Eaton P, and Geels D, Oceanstore: An Architecture for Global-Scale Persistent Storage," ACM SIGPLAN Notices, 35(11), 2000, 190-201. (Pubitemid 32470898)
7. Li J, Taylor J, Serban L, and Seltzer M, Self-Organization in Peerto- Peer System, Proc. ACM SIGOPS, 2002.
8. Cuena-Acuna F.M, Peery C,Martin R.P, and Nguyen T.D, PlantP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities, Proc. 12th IEEE Int'lSymp. High Performance Distributed Computing, 2003, 236-249
9. Rhea S.C and Kubiatowicz J, Probabilistic Location and Routing, Proc. IEEE INFOCOM, 2004, 1248-1257.
10. Hodes T.D, Czerwinski S.E, and Zhao B.Y, An Architecture for Secure Wide Area Service Discovery, Wireless Networks, vol. 8, nos. 2/3, 2002, 213-230. (Pubitemid 34168128)
11. Reynolds P and Vahdat A, Efficient Peer-to-Peer Keyword Searching, Proc. ACM Int'l Middleware Conf., 2003, 21-40.
12. Bauer D, Hurley P, Pletka R, and Waldvogel M, Bringing Efficient Advanced Queries to Distributed Hash Tables, Proc. IEEE Conf. Local Computer Networks, 2004, 6-14
13. Fan L, Cao P, Almeida J, and Broder A, Summary Cache: A Scalable Wide Area Web Cache Sharing Protocol, IEEE/ACM Trans. Networking, 8(3), 2000, 281-293.
14. Peter C.D and Panagiotis M, Bloom Filters in Probabilistic Verification, Proc. Fifth Int'l Conf. Formal Methods in Computer- Aided Design, 2004, 367-381.
15. Jin C, Qian W, and Zhou A, Analysis and Management of Streaming Data: A Survey, J. Software, 15(8), 2004, 1172-1181.
16. Deng F and Rafiei D, "Approximately Detecting Duplicates for Streaming Data Using Stable Bloom Filters," Proc. 25th ACMSIGMOD, 2006, 25-36.
17. Bonomi F, Mitzenmacher M, Panigrahy R, Singh S, andVarghese G, Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines, Proc. ACM SIGCOMM, 2006, 315-326.
18. Li K and Zhong Z, Fast Statistical Spam Filter by Approximate Classifications, Proc. Joint Int'l Conf. Measurement and Modeling of Computer Systems, SIGMETRICS/Performance, 2006, 347-358.
19. Mitzenmacher M, Compressed Bloom Filters, IEEE/ACM Trans.Networking, 10(5) 2002, 604-612. (Pubitemid 35312139)
20. Kirsch A and Mitzenmacher M, Building a Better Bloom Filter, Technical Report tr-02-05.pdf, Dept. of Computer Science, Harvard Univ,2006.
21. Kirsch A and Mitzenmacher M, Distance-Sensitive Bloom Filters, Proc. Eighth Workshop Algorithm Eng. and Experiments (ALENEX '06), 2006.
22. Kumar A, Xu J, Wang J, Spatschek O, and Li L, Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement, Proc. 23rd IEEE INFOCOM, 2004, 1762-1773.
23. Cohen S and Matias Y, Spectral Bloom Filters, Proc. 22nd ACM SIGMOD, 2003, 241-252.
24. Laufer R.P, Velloso P.B, and Duarte O.C.M.B, GeneralizedBloom Filters, Technical Report Research Report GTA-05-43, Univ. of California, Los Angeles (UCLA), 2005.
25. Chazelle B, Kilian J, Rubinfeld R, and Tal A, The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables, Proc. Fifth Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), 2004, 30-39.
26. Hao F, Kodialam M, and Lakshman T.V, Building High Accuracy Bloom Filters Using Partitioned Hashing, Proc. SIGMETRICS/Performance, 2007, 277-287.
27. Yang X.S., Deb S. "Cuckoo search via Lévy flights". World Congress on Nature & Biologically Inspired Computing (NaBIC 2009). IEEE Publications. 2009, 210-214.
28. Xie K., Min Y., Zhang D., Wen J., Xie G. & Wen J, Basket Bloom Filters for Membership Queries, Proceedings of IEEE Tencon'05,2005, 1-6.