L-priorities bloom filter: A new member of the bloom filter family

  • Authors:
  • Huang-Shui Hu;Hong-Wei Zhao;Fei Mi

  • Affiliations:
  • College of Computer Science and Technology, Jilin University, Changchun, PRC 130012;College of Computer Science and Technology, Jilin University, Changchun, PRC 130012 and Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education, Jilin University ...;Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education, Jilin University, Changchun, PRC 130012

  • Venue:
  • International Journal of Automation and Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.