A Model for Learned Bloom Filters and Related Structures

2018/02/03 by Michael Mitzenmacher, Mitzenmacher, Michael · 2 citations
Computer Science · Engineering · #Advanced Memory and Neural Computing #Caching and Content Delivery #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and ELM #cs.DS

paper · pdf · doi:10.48550/arxiv.1802.00884

5 pages, commentary on the "Learned Index Structures" paper

arxiv created 2018/02/03 · openalex publication_date 2018/02/03 · arxiv updated 2018/02/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Recent work has suggested enhancing Bloom filters by using a pre-filter, based on applying machine learning to model the data set the Bloom filter is meant to represent. Here we model such learned Bloom filters, clarifying what guarantees can and cannot be associated with such a structure.

Cited by

• Optimizing Learned Bloom Filters by Sandwiching
• A Model for Learned Bloom Filters, and Optimizing by Sandwiching

Related

• A Model for Learned Bloom Filters, and Optimizing by Sandwiching
• On the Choice of General Purpose Classifiers in Learned Bloom Filters:\n An Initial Analysis Within Basic Filters
• Partitioned Learned Bloom Filter
• Adaptive Learned Bloom Filter (Ada-BF): Efficient Utilization of the Classifier
• A Critical Analysis of Classifier Selection in Learned Bloom Filters