Results 271 to 280 of about 2,234,842 (311)

Ternary Bloom filter replacing counting Bloom filter

2016 IEEE International Conference on Consumer Electronics-Asia (ICCE-Asia), 2016
A counting Bloom filter (CBF) generalizes a standard 1-bit vector Bloom filter and allows not only membership queries but also insertion and deletion operations for dynamic sets. However, the CBF can cause false negatives because of counter overflows. A 4-bit vector CBF, which provides the probability of false negatives sufficiently small, is generally
Hayoung Byun, Jungwon Lee, Hyesook Lim
openaire   +1 more source

PFBF: Pre-Filtered Bloom Filters

2015
In 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   +2 more sources

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), 2017
Bloom 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   +2 more sources

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

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

Low Computational Cost Bloom Filters

IEEE/ACM Transactions on Networking, 2018
Bloom filters (BFs) are widely used in many network applications but the high computational cost limits the system performance. In this paper, we introduce a low computational cost Bloom filter named One-Hashing Bloom filter (OHBF) to solve the problem ...
Jianyuan Lu, Tong Yang, Yi Wang, Huichen Dai, Xi Chen, Linxiao Jin, Haoyu Song, Bin Liu   +7 more
semanticscholar   +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

Bet-or-Pass: Adversarially Robust Bloom Filters

IACR Cryptology ePrint Archive, 2022
M. Naor, Noa Oved
semanticscholar   +1 more source

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