The Veracious Counting Bloom Filter
Journal: The International Arab Journal of Information Technology (Vol.14, No. 6)Publication Date: 2017-11-01
Authors : Brindha Palanisamy; Senthilkumar Athappan;
Page : 890-896
Keywords : Bloom filter; false positive; counting bloom filter; intrusion detection system;
Abstract
Counting Bloom Filters (CBFs) are widely employed in many applications for fast membership queries. CBF works on dynamic sets rather than a static set via item insertions and deletions. CBF allows false positive, but not false negative. The Bh-Counting Bloom Filter (Bh-CBF) and Variable Increment Counting Bloom Filter (VI-CBF) are introduced to reduce the False Positive Probability (FPP), but they suffer from memory overhead and hardware complexity. In this paper, we proposed a multilevel optimization approach named as Veracious Bh-Counting Bloom Filter (VBh-CBF) and Veracious Variable Increment Counting Bloom Filter (VVI-CBF) by partitioning the counter vector into multiple levels to reduce the FPP and to limit the memory requirement. The experiment result shows that the FPP and total memory size are reduced by 65.4%, 67.74% and 20.26%, 41.29% respectively compared to basic Bh-CBF and VI-CBF.
Other Latest Articles
- A Novel Swarm Intelligence Algorithm for the Evacuation Routing Optimization Problem
- Efficient Segmentation of Arabic Handwritten Characters Using Structural Features
- Internal Model Control to Characterize Human Handwriting Motion
- TDMCS: An Efficient Method for Mining Closed Frequent Patterns over Data Streams Based on Time Decay Model
- An Architecture of Thin Client-Edge Computing Collaboration for Data Distribution and Resource Allocation in Cloud
Last modified: 2019-05-09 19:21:49