Results 261 to 270 of about 13,604 (287)
Some of the next articles are maybe not open access.
PFBF: Pre-Filtered Bloom Filters
2015In this paper we focus on improving the false positive rate of a bloom filter with a pre-filtering scheme. By applying this scheme on a bloom filter, we can quickly screen out lots of input before entering the bloom filter and hence improve the result of false positives.
Ssu-Ting Liu, Sheng-De Wang
openaire +1 more source
A new Bloom filter structure for identifying true positiveness of a Bloom filter
2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR), 2017Bloom filters have been employed in various fields because of its simple and effective structure in identifying the membership of an input. Since a Bloom filter can produce false positives, the positive results of a Bloom filter should be identified whether the positives are true or not by accessing the original database.
Ju Hyoung Mun, Jungwon Lee, Hyesook Lim
openaire +1 more source
L-priorities bloom filter: A new member of the bloom filter family
International Journal of Automation and Computing, 2012A 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
Huangshui Hu, Hongwei Zhao, Fei Mi
openaire +1 more source
Dynamic reordering bloom filter
2017 19th Asia-Pacific Network Operations and Management Symposium (APNOMS), 2017In order to check a membership in multiple sets of bloom filter in a dynamic bloom filter, a sequential search is usually used. Since the distribution of queried data is unpredictable because the distribution has a feature of temporal locality. Therefore more search cost is incurred if queried data is stored in the peer which is corresponded to the ...
Da-Chung Chang +2 more
openaire +1 more source
Evaluation of the Structured Bloom Filter
2010 International Conference on Complex, Intelligent and Software Intensive Systems, 2010A Bloom filter offers a simple space-efficient randomized data structure for representing a set in order to support membership queries. The Bloom filter has become attractive as one of the methods of looking up data in the distributed system. Since two or more keywords can be used in the method based on the Bloom filter, it is more flexible than the ...
openaire +1 more source
Bloom Filters in Probabilistic Verification
2004Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic schemes are hash compaction and the bitstate method, which stores states in a Bloom filter. Bloom filters have been criticized for being slow, inaccurate, and memory-inefficient, but in this
Peter C. Dillinger, Panagiotis Manolios
openaire +1 more source
A second look at bloom filters
Communications of the ACM, 1983This note deals with a paper by Gremillion demonstrating the simulation approach to the design of a Bloom filter. It is shown that an analytical approach can yield insights into competing filter design and give expected values for the goodness-of-hash transformations not available with simulation.
openaire +1 more source
Does not Bloom Filter bloom in membership filtering?
2023Ripon Patgiri +2 more
openaire +1 more source
A Critical Analysis of Classifier Selection in Learned Bloom Filters: The Essentials
Communications in Computer and Information Science, 2023Dario Malchiodi +2 more
exaly