Optimal Semijoins for Distributed Database Systems
IEEE Transactions on Software Engineering
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Informed content delivery across adaptive overlay networks
IEEE/ACM Transactions on Networking (TON)
Information Processing Letters
Bloom filter based secure and anonymous DSR protocol in wireless ad hoc networks
International Journal of Security and Networks
Hierarchical packet classification using a Bloom filter and rule-priority tries
Computer Communications
Accelerating the bit-split string matching algorithm using Bloom filters
Computer Communications
A new analysis of the false positive rate of a Bloom filter
Information Processing Letters
Improving retouched Bloom filter for trading off selected false positives against false negatives
Computer Networks: The International Journal of Computer and Telecommunications Networking
An adaptive median filter algorithm based on B-spline function
International Journal of Automation and Computing
Hi-index | 0.00 |
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.