Results 271 to 280 of about 696,655 (295)

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

International Journal of Automation and Computing, 2012
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
Huangshui Hu, Hongwei Zhao, Fei Mi
openaire   +1 more source

Dynamic reordering bloom filter

2017 19th Asia-Pacific Network Operations and Management Symposium (APNOMS), 2017
In 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, Chien Chen, Mahadevan Thanavel   +2 more
openaire   +2 more sources

A second look at bloom filters

Communications of the ACM, 1983
This 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.
exaly   +2 more sources

Does not Bloom Filter bloom in membership filtering?

2023
Ripon Patgiri, Sabuzima Nayak, Naresh Babu Muppalaneni   +2 more
openaire   +1 more source

Evaluation of the Structured Bloom Filter

2010 International Conference on Complex, Intelligent and Software Intensive Systems, 2010
A 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   +2 more sources

Bloom Filters in Probabilistic Verification

2004
Probabilistic 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   +2 more sources

Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters

Journal of Experimental Algorithmics, 2020
Daniel Lemire
exaly  

Ternary Bloom Filter Improving Counting Bloom Filter

Journal of the Institute of Electronics and Information Engineers, 2017
Hayoung Byun, Jungwon Lee, Hyesook Lim
openaire   +1 more source

Theory and Practice of Bloom Filters for Distributed Systems

IEEE Communications Surveys and Tutorials, 2012
Christian Esteve Rothenberg
exaly  

The Bloom Paradox: When Not to Use a Bloom Filter

IEEE/ACM Transactions on Networking, 2015
Isaac Keslassy, Ori Rottenstreich
exaly