Browse > Article
http://dx.doi.org/10.13089/JKIISC.2014.24.5.809

An Analysis on the Error Probability of A Bloom Filter  

Kim, SungYong (Semyung University)
Kim, JiHong (Semyung University)
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 introduce the error probabilities in Bloom filter. Especially, we derive the revised false positive rates of the Bloom filter using experimental method. Finally we analyze and compare the original false positive probability of the bloom filter used until now and the false decision probability proposed in this paper.
Keywords
Bloom filter; False Positive Rate; False Negative Rate;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B. Bloom, "Space/Time Trade-offs in Hash Coding with Allowable Errors" Communications of the ACM, Vo1. 13, No. 7, pp. 422-426, Nov. 1970.
2 A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters : A Survey", Internet Mathematics, Vol. I, No. 4, pp. 485-509, 2004.
3 P. Bose, H. Guo, and E. Kranakis, "ON THE FALSE-POSITIVE RATE OF BLOOM FILTERS", School of Computers Science, Carleton University, May. 2004.
4 K. Christensen, A. Roginsky, and M. Jimeno, "A new analysis of the false positive rate of a Bloom filter", Information Processing Letters 110, pp. 944-949, 2010.   DOI
5 O. Rottenstreich and I. Keslassy, "The Bloom Paradox: When not to Use a Bloom Filter?", INFOCOM, pp. 1638-1646, Mar. 2012.
6 L. Fan, P. Cao, and J. Almeida, "Summary Cache : A Scalable Wide-Area Web Cache Sharing Protocol.", IEEE/ACM Transactions on Networking, vol. 8, no. 3, pp. 281-293, June. 2000.   DOI   ScienceOn
7 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