期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
L-priorities Bloom Filter: A New Member of the Bloom Filter Family 被引量:1
1
作者 Huang-Shui Hu Hong-Wei Zhao Fei Mi 《International Journal of Automation and computing》 EI 2012年第2期171-176,共6页
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 fil... 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. 展开更多
关键词 Bloom filter bit space matrix false positive l-priorities time and space complexity.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部