Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

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)
  • Received : 2017.02.11
  • Accepted : 2017.04.19
  • Published : 2017.06.30
Download PDF
⟨ Previous Next ⟩

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

References

  1. A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters : A Survey," Internet Mathematics, vol.1, no. 4, pp. 485-509, Jan. 2004. https://doi.org/10.1080/15427951.2004.10129096
  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. https://doi.org/10.1109/SURV.2011.031611.00024
  3. M. Michael Mitzenmacher, "Compressed Bloom Filters," IEEE/ACM Transactions on Networking, vol.10, no.5, pp.604-612, Oct. 2002. https://doi.org/10.1109/TNET.2002.803864
  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. 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. https://doi.org/10.1016/j.comnet.2010.12.025
  7. 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.
  8. 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. https://doi.org/10.1109/LCOMM.2010.06.100344
  9. 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. https://doi.org/10.1109/TPDS.2013.223
  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. https://doi.org/10.1109/LCOMM.2015.2478462