Browse > Article
http://dx.doi.org/10.6109/jkiice.2017.21.6.1113

The Construction of A Parallel type Bloom Filter  

Jang, Young-dal (Department of Information and Communication Engineering, Semyung University)
Kim, Ji-hong (Department of Information and Communication Engineering, Semyung University)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.21, no.6, 2017 , pp. 1113-1120 More about this Journal
Abstract
As the size of the data is getting larger and larger due to improvement of the telecommunication techniques, it would be main issues to develop and process the database. The bloom filter used to lookup a particular element under the given set is very useful structure because of the space efficiency. In this paper, we analyse the main factor of the false positive and propose the new parallel type bloom filter in order to minimize the false positive which is caused by other hash functions. The proposed method uses the memory as large as the conventional bloom filter use, but it can improve the processing speed using parallel processing. In addition, if we use the perfect hash function, the insertion and deletion function in the proposed bloom filter would be possible.
Keywords
Bloom filter; False Positive Rate; Parallel Bloom filter; Hash Function;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters : A Survey," Internet Mathematics, vol.1, no. 4, pp. 485-509, Jan. 2004.   DOI
2 S. Tarkoma, C. E. Lagerspetz, and E. Lagerspetz, "Theory and Practice of Bloom Filters for Distributed Systems," IEEE Communications Surveys and Tutorials, vol.14, no.1, pp.131-155 , Mar. 2012.   DOI
3 M. Michael Mitzenmacher, "Compressed Bloom Filters," IEEE/ACM Transactions on Networking, vol.10, no.5, pp.604-612, Oct. 2002.   DOI
4 L. Fan, P. Cao, J. Almeida, and A. Z. Broder, "Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol," IEEE/ACM Transactions on Networking, vol. 8, no.3, pp. 281-293, Aug. 2002.
5 R. P. Laufer, P. B. Velloso, and O. C. M. B. Duarte, L. Fan, P. Cao, J. Almeida, and A. Z. Broder, "Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol," IEEE/ACM Transactions on Networking, vol. 8, no.3, pp. 281-293, Aug. 2002.
6 F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese, "An improved Construction for Counting Bloom Filters," in 14th Annual European Symposium an Algorithms, LNCS 4168, pp. 684-695, Sep. 2006.
7 C. E. Rothenberg, C. A. B. Macapuna, F. L. Verdi, and M.Magalhaes, "The deletable Bloom Filters: a new member of the Bloom family," IEEE Communications Letters, vol. 14, no. 6, pp. 557-559, June 2010.   DOI
8 J. Qian, Q. Zhu, and Y. Wang, "Bloom Filter Based Associative Deletion," IEEE transactions on parallel and distributed syst, vol.25, no.8, pp. 1986-1998, Aug. 2014.   DOI
9 R. P. Laufer, P. B. Velloso, and O. C. M. B. Duarte "A Generalized Bloom Filter to Secure Distributed Network Applications," Computer Networks, vol. 55, no. 8, pp. 1804-1819, June 2011.   DOI
10 H. Lim, J. Lee, and C. Yim, "Complement Bloom Filter for Identifying True Positiveness of a Bloom Filter," IEEE communications letters, vol.19, no.11, pp. 1905-1908, Sep. 2015.   DOI