Results 261 to 270 of about 628,634 (288)

Fast Bloom Filters and Their Generalization

IEEE Transactions on Parallel and Distributed Systems, 2014
Bloom filters have been extensively applied in many network functions. Their performance is judged by three criteria: query overhead, space requirement, and false positive ratio. Due to wide applicability, any improvement to the performance of Bloom filters can potentially have a broad impact in many areas of networking research.
Yan Qiao, Tao Li 0013, Shigang Chen
openaire   +2 more sources

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

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

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.
openaire   +1 more source

deepBF: Malicious URL detection using learned Bloom Filter and evolutionary deep learning

Computer Communications, 2023
Sabuzima Nayak, Ripon Patgiri, Anupam Biswas   +2 more
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

Iris template protection using double bloom filter based feature transformation

Computers and Security, 2020
Ajish Sreedharan
exaly  

On the Evolutionary of Bloom Filter False Positives - An Information Theoretical Approach to Optimizing Bloom Filter Parameters

IEEE Transactions on Knowledge and Data Engineering, 2022
Yang Zhou, Alex Liu, Zhuochen Fan
exaly  

PassDB: A password database with strict privacy protocol using 3D Bloom filter

Information Sciences, 2020
Sabuzima Nayak, Ripon Patgiri, Samir Kumar Borgohain   +2 more
exaly