At the intersection of two domains: machine learning and data structures lie learned data structures. Learned data structures offer improved performance as compared to their classical counterparts by making use of trends in the input data. We will explore Learned Bloom Filters which build on classical Bloom Filters and offer trade-offs which can be used to achieve optimum performance in some applications.
Bloom Filters
Motivation
A membership query returns a yes/no answer to a question of the form “Is this element \(x\) present in a given set \(S\)?”
Searching algorithms like linear search and binary search can be used to answer this... read more