Bloom Filters, Cuckoo Hashing, Cuckoo Filters, Adaptive Cuckoo Filters, and Learned Bloom Filters
MetadataShow full item record
I will go over some of my past and present work on hashing-based data structures. After presenting some background on Bloom filters and cuckoo hashing, we will describe cuckoo filters, an efficient data structure for approximate set membership that improves on the well-known Bloom filter. We then discuss recent work on how to make cuckoo filters adaptive in response to false positives, which can be important for many practical problems. Finally, I will present some very recent work on how to possibly improve Bloom filters and related data structures using machine learning techniques.
- ARC Talks and Events 
Showing items related by title, author, creator and subject.
Patnaik, Rohit; Vandrasi, Vivek; Madsen, Christi K.; Eftekhar, Ali Asghar; Adibi, Ali (Georgia Institute of TechnologyInstitute of Electrical and Electronics Engineers ; Optical Society of America, 2010-12)We examine the use of different high-level filter architectures (cascade, lattice, and parallel). We discuss their advantages and disadvantages, and we present simulation results and filter-tolerance tests. This information ...
Rathi, Yogesh; Vaswani, Namrata; Tannenbaum, Allen R.; Yezzi, Anthony (Georgia Institute of TechnologyInstitute of Electrical and Electronics Engineers, 2007-08)Tracking deforming objects involves estimating the global motion of the object and its local deformations as a function of time. Tracking algorithms using Kalman filters or particle filters have been proposed for ...
Gee, Wesley Albert (Georgia Institute of Technology, 2005-07-15)In wireless transceiver circuits some of the most prevalent required off-chip components are discrete filters. These components are generally implemented with surface acoustic wave (SAW) or ceramic components. These devices ...