Multi-Granularities Counting Bloom Filter

2006 ◽  
pp. 542-551
Author(s):  
Zhou Mingzhong ◽  
Gong Jian ◽  
Ding Wei ◽  
Cheng Guang
Keyword(s):  
Bloom Filter ◽  
Counting Bloom Filter

The Variable-Increment Counting Bloom Filter

2014 ◽  
Vol 22 (4) ◽  
pp. 1092-1105 ◽  
Author(s):  
Ori Rottenstreich ◽  
Yossi Kanizo ◽  
Isaac Keslassy
Keyword(s):  
Bloom Filter ◽  
Counting Bloom Filter

Improving counting Bloom filter performance with fingerprints

2016 ◽  
Vol 116 (4) ◽  
pp. 304-309 ◽  
Author(s):  
Salvatore Pontarelli ◽  
Pedro Reviriego ◽  
Juan Antonio Maestro
Keyword(s):  
Bloom Filter ◽  
Filter Performance ◽  
Counting Bloom Filter

Parloom: A New Low-Power Set-Associative Instruction Cache Architecture Utilizing Enhanced Counting Bloom Filter and Partial Tags

2019 ◽  
Vol 28 (12) ◽  
pp. 1950203
Author(s):  
Sajjad Rostami-Sani ◽  
Mojtaba Valinataj ◽  
Saeideh Alinezhad Chamazcoti
Keyword(s):  
Energy Consumption ◽  
System Performance ◽  
Bloom Filter ◽  
Instruction Cache ◽  
Cache Architecture ◽  
Power Set ◽  
Novel Method ◽  
Instruction Caches ◽  
Cache System ◽  
Counting Bloom Filter

The cache system dissipates a significant amount of energy compared to the other memory components. This will be intensified if a cache is designed with a set-associative structure to improve the system performance because the parallel accesses to the entries of a set for tag comparisons lead to even more energy consumption. In this paper, a novel method is proposed as a combination of a counting Bloom filter and partial tags to mitigate the energy consumption of set-associative caches. This new hybrid method noticeably decreases the cache energy consumption especially in highly-associative instruction caches. In fact, it uses an enhanced counting Bloom filter to predict cache misses with a high accuracy as well as partial tags to decrease the overall cache size. This way, unnecessary tag comparisons can be prevented and therefore, the cache energy consumption is considerably reduced. Based on the simulation results, the proposed method provides the energy reduction from 22% to 31% for 4-way–32-way set-associative L1 caches bigger than 16[Formula: see text]kB running the MiBench programs. The improvements are attained with a negligible system performance degradation compared to the traditional cache system.

scholarly journals False Negative Problem of Counting Bloom Filter

2010 ◽  
Vol 22 (5) ◽  
pp. 651-664 ◽  
Author(s):  
Deke Guo ◽  
Yunhao Liu ◽  
Xiangyang Li ◽  
Panlong Yang
Keyword(s):  
False Negative ◽  
Bloom Filter ◽  
Counting Bloom Filter

scholarly journals VOTE: Verifiable Auditing for Outsourced Database with Token Enforced Cloud Storage

2019 ◽  
Vol 9 (2) ◽  
pp. 5156-5166
Keyword(s):  
Cloud Storage ◽  
Bloom Filter ◽  
Cloud Service ◽  
Communication Cost ◽  
Cloud Service Provider ◽  
Merkle Hash Tree ◽  
Database Administration ◽  
Outsourced Database ◽  
Counting Bloom Filter ◽  
Null Set

Database deploying is one of the remarkable utilities in cloud computing where the Information Proprietor (IP) assigns the database administration to the Cloud Service Provider (CSP) in order to lower the administration overhead and preservation expenditures of the database. Regardless of its overwhelming advantages, it experiences few security problems such as confidentiality of deployed database and auditability of search outcome. In recent past, survey has been carried out on the auditability of search outcome of deployed database that gives preciseness and intactness of search outcome. But in the prevailing schemes, since there is flow of data between IP and the clients repeatedly, huge communication cost is incurred at the Information Proprietor side. To address this challenge, we introduce Verifiable Auditing of Outsourced Database with Token Enforced Cloud Storage (VOTE) mechanism based on Merkle Hash Tree (MHT), Invertible Bloom Filter(IBF) and Counting Bloom Filter(CBF). The proposed scheme reduces the huge communication cost at the Information Proprietor side and achieves preciseness and intactness of the search outcome. Experimental analysis show that the proposed scheme has totally reduced the huge communication cost at the Information Proprietor side, and simultaneously achieves the preciseness and intactness of search outcome though the semi- trusted CSP deliberately sends a null set

Sign in / Sign up

Export Citation Format

Share Document