Abstract
A Bloom filter is a space-efficient data structure used for concisely representing a set as well as membership queries at the expense of introducing false positive. In this paper, we propose the L-priorities Bloom filter (LPBF) as a new member of the Bloom filter (BF) family, it uses a limited multidimensional bit space matrix to replace the bit vector of standard bloom filters in order to support different priorities for the elements of a set. We demonstrate the time and space complexity, especially the false positive rate of LPBF. Furthermore, we also present a detailed practical evaluation of the false positive rate achieved by LPBF. The results show that LPBF performs better than standard BFs with respect to false positive rate.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, vol. 13, no. 7, pp. 422–426, 1970.
K. Huang, D. F. Zhang, Z. Qin. Accelerating the bit-split string matching algorithm using bloom filters. Computer Communications, vol. 33, no. 15, pp. 1785–1794, 2010.
J. K. Mullin. Optimal semijoins for distributed database systems. IEEE Transactions on Software Engineering, vol. 16, no. 5, pp. 558–560, 1990.
A. Broder, M. Mitzenmacher. Network applications of bloom filters: A survey. Internet Mathematics, vol. 1, no. 4, pp. 485–509, 2003.
F. Li, C. Pei, J. Almeida, A. Broder. Summary cache: A scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking, vol. 8, no. 3, pp. 281–293, 2000.
L. M. Guo, S. B. Yang, S. L. Wang, R. Zhang, X. L. Niu. Replication consistency maintenance mechanism based on physical-location and bloom-filter for unstructured P2P network. Journal of Electronics and Information Technology, vol. 33, no. 4, pp. 1012–1016, 2011. (in Chinese)
P. Valdurez, G. Gardarin. Join and semijoin algorithms for a multiprocessor database machine. ACM Transactions on Database Systems, vol. 9, no. 1, pp. 133–161, 1984.
J. W. Byers, J. Considine, M. Mitzenmacher, S. Rost. Informed content delivery across adaptive overly networks. IEEE/ACM Transactions on Networking, vol. 12, no. 5, pp. 768–780, 2004.
L. Xu, S. S. Chen, X. Y. Huang, Y. Mu. Bloom filter based secure and anonymous DSR protocol in wireless ad hoc networks. International Journal of Security and Networks, vol. 5, no. 1, pp. 35–44, 2010.
A. G. A. Priya, H. Lim. Hierarchical packet classification using a Bloom filter and rule-priority tries. Computer Communications, vol. 33, no. 10, pp. 1215–1226, 2010.
K. Christensen, A. Roginsky, M. Jimeno. A new analysis of the false positive rate of a Bloom filter. Information Processing Letters, vol. 110, no. 21, pp. 944–949, 2010.
P. S. Almeida, C. Baquero, N. Preguica, D. Hutchison. Scalable bloom filters. Information Processing Letters, vol. 101, no. 6, pp. 255–261, 2007.
S. Cohen, Y. Matias. Spectral Bloom filters. In Proceedings of the ACM SIGMOD International Conference on Management of Data, ACM, San Diego, USA, pp. 241–252, 2003.
M. Mitzenmacher. Compressed Bloom filters. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, USA, pp. 144–150, 2001.
D. Benoit, B. Bruno, F. Timur. Improving retouched bloom filters for trading off selected false positive against false negatives. Computer Network, vol. 54, no. 18, pp. 3373–3387, 2010.
D. T. Pham, E. Koc. Design of a two-dimensional recursive filter using the bees algorithm. International Journal of Automation and Computing, vol. 7, no. 3, pp. 399–402, 2010.
M. S. Pan, J. T. Tang, X. L. Yang. An adaptive median filter algorithm based on B-spline function. International Journal of Automation and Computing, vol. 8, no. 1, pp. 92–99, 2011.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by Project of Plan for Science and Technology Development of Jilin Province (No. 20101504) and Project of Research of Science and Technology for the 11th Five-year Plan of Jilin Education Department (No. 2009604).
Huang-Shui Hu received the B. Sc. and M. Sc. degrees in computer science from Jilin University, PRC in 1999 and 2005, respectively. Now, he is a Ph. D. candidate at the College of Computer Science and Technology, Jilin University.
His research interests include computer network, embedded real-time systems, and fault diagnosis.
Hong-Wei Zhao received B. Sc. degree in computer science from Jilin University of Technology, PRC in 1985 and M. Sc. degree in information engineering from Jilin University of Technology in 1993. He received Ph.D. degree in mechanical engineering from Jilin University in 2001. Currently, he is a professor of Jilin University, PRC and conducts research in the area of computer science.
His research interests include intelligent information system and thinking computation.
Fei Mi received the B. Sc. degrees in computer science from Jilin University, PRC in 2008. Now, he is a M. Sc. student of the College of Computer Science and Technology, Jilin University.
His research interests include signal processing, and artificial intelligence.
Rights and permissions
About this article
Cite this article
Hu, HS., Zhao, HW. & Mi, F. L-priorities bloom filter: A new member of the bloom filter family. Int. J. Autom. Comput. 9, 171–176 (2012). https://doi.org/10.1007/s11633-012-0630-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11633-012-0630-8