robustBF: A High Accuracy and Memory Efficient 2D Bloom Filter

06/06/2021
by   Ripon Patgiri, et al.
0

Bloom Filter is an important probabilistic data structure to reduce memory consumption for membership filters. It is applied in diverse domains such as Computer Networking, Network Security and Privacy, IoT, Edge Computing, Cloud Computing, Big Data, and Biometrics. But Bloom Filter has an issue of the false positive probability. To address this issue, we propose a novel robust Bloom Filter, robustBF for short. robustBF is a 2D Bloom Filter, capable of filtering millions of data with high accuracy without compromising the performance. Our proposed system is presented in two-fold. Firstly, we modify the murmur hash function, and test all modified hash functions for improvements and select the best-modified hash function experimentally. Secondly, we embed the modified hash functions in 2D Bloom Filter. Our experimental results show that robustBF is better than standard Bloom Filter and counting Bloom Filter in every aspect. robustBF exhibits nearly zero false positive probability with more than 10× and 44× lower memory consumption than standard Bloom filter and counting Bloom Filter, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/06/2021

countBF: A General-purpose High Accuracy and Space Efficient Counting Bloom Filter

Bloom Filter is a probabilistic data structure for the membership query,...
research
03/18/2021

deepBF: Malicious URL detection using Learned Bloom Filter and Evolutionary Deep Learning

Malicious URL detection is an emerging research area due to continuous m...
research
06/13/2021

Hash Adaptive Bloom Filter

Bloom filter is a compact memory-efficient probabilistic data structure ...
research
08/13/2019

On Occupancy Moments and Bloom Filter Efficiency

Two multivariate committee distributions are shown to belong to Berg's f...
research
05/30/2022

Daisy Bloom Filters

Weighted Bloom filters (Bruck, Gao and Jiang, ISIT 2006) are Bloom filte...
research
02/19/2018

On the computation of Shannon Entropy from Counting Bloom Filters

In this short note a method for computing the naive plugin estimator of ...
research
05/11/2021

Smart Name Lookup for NDN Forwarding Plane via Neural Networks

Name lookup is a key technology for the forwarding plane of content rout...

Please sign up or login with your details

Forgot password? Click here to reset