Adaptive Learned Bloom Filter (Ada-BF): Efficient Utilization of the Classifier

10/21/2019
by   Zhenwei Dai, et al.
0

Recent work suggests improving the performance of Bloom filter by incorporating a machine learning model as a binary classifier. However, such learned Bloom filter does not take full advantage of the predicted probability scores. We proposed new algorithms that generalize the learned Bloom filter by using the complete spectrum of the scores regions. We proved our algorithms have lower False Positive Rate (FPR) and memory usage compared with the existing approaches to learned Bloom filter. We also demonstrated the improved performance of our algorithms on real-world datasets.

READ FULL TEXT

page 8

page 9

research
06/05/2020

Partitioned Learned Bloom Filter

Bloom filters are space-efficient probabilistic data structures that are...
research
01/03/2019

A Model for Learned Bloom Filters, and Optimizing by Sandwiching

Recent work has suggested enhancing Bloom filters by using a pre-filter,...
research
01/15/2018

tau-FPL: Tolerance-Constrained Learning in Linear Time

Learning a classifier with control on the false-positive rate plays a cr...
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
11/28/2022

A Critical Analysis of Classifier Selection in Learned Bloom Filters

Learned Bloom Filters, i.e., models induced from data via machine learni...
research
01/27/2015

A Probabilistic Least-Mean-Squares Filter

We introduce a probabilistic approach to the LMS filter. By means of an ...
research
06/30/2022

Proteus: A Self-Designing Range Filter

We introduce Proteus, a novel self-designing approximate range filter, w...

Please sign up or login with your details

Forgot password? Click here to reset