On the Choice of General Purpose Classifiers in Learned Bloom Filters: An Initial Analysis Within Basic Filters

12/13/2021
by   Giacomo Fumagalli, et al.
0

Bloom Filters are a fundamental and pervasive data structure. Within the growing area of Learned Data Structures, several Learned versions of Bloom Filters have been considered, yielding advantages over classic Filters. Each of them uses a classifier, which is the Learned part of the data structure. Although it has a central role in those new filters, and its space footprint as well as classification time may affect the performance of the Learned Filter, no systematic study of which specific classifier to use in which circumstances is available. We report progress in this area here, providing also initial guidelines on which classifier to choose among five classic classification paradigms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/05/2018

Optimizing Learned Bloom Filters by Sandwiching

We provide a simple method for improving the performance of the recently...
research
02/21/2022

On the Suitability of Neural Networks as Building Blocks for The Design of Efficient Learned Indexes

With the aim of obtaining time/space improvements in classic Data Struct...
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
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
08/05/2022

Compressing (Multidimensional) Learned Bloom Filters

Bloom filters are widely used data structures that compactly represent s...
research
11/19/2019

Concurrent Expandable AMQs on the Basis of Quotient Filters

A quotient filter is a cache efficient AMQ data structure. Depending on ...

Please sign up or login with your details

Forgot password? Click here to reset