no code implementations • 29 Nov 2021 • Benjamin Spector, Andreas Kipf, Kapil Vaidya, Chi Wang, Umar Farooq Minhas, Tim Kraska
RSS achieves this by using the minimal string prefix to sufficiently distinguish the data unlike most learned approaches which index the entire string.
no code implementations • ICLR 2021 • Kapil Vaidya, Eric Knorr, Michael Mitzenmacher, Tim Kraska
Bloom filters are space-efficient probabilistic data structures that are used to test whether an element is a member of a set, and may return false positives.
no code implementations • 5 Jun 2020 • Kapil Vaidya, Eric Knorr, Tim Kraska, Michael Mitzenmacher
Bloom filters are space-efficient probabilistic data structures that are used to test whether an element is a member of a set, and may return false positives.
