Bloom Filter
Bloom filters are probabilistic data structures that efficiently test whether an element is a member of a set, accepting a small probability of false positives. Current research focuses on improving their accuracy and efficiency, particularly through the integration of machine learning techniques, such as employing neural networks as classifiers within "learned Bloom filters" and exploring alternative representations to reduce memory footprint. These advancements are impacting various applications, including accelerating similarity joins in high-dimensional data, enhancing recommendation systems, and improving the performance of text-to-video generation pipelines by optimizing memory usage and query times.
Papers
February 20, 2024
September 25, 2023
May 12, 2023
November 28, 2022
August 5, 2022
February 21, 2022
December 13, 2021