176 citations · 382 across the 20 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Defeating duplicates: A re-design of the LearnedSort algorithm
Ani Kristo, Kapil Vaidya, Tim Kraska
LearnedSort is a novel sorting algorithm that, unlike traditional methods, uses fast ML models to boost the sorting speed. The models learn to estimate the input's distribution and…
cs.DS2020★ 4 cited
Partitioned Learned Bloom Filter
Kapil Vaidya, Eric Knorr, Tim Kraska +1
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. Recently, variations…