4 citations · 6 across the 2 of their papers we have counts for
3 papers
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.DB2021★ 2 cited
When Are Learned Models Better Than Hash Functions?
Ibrahim Sabek, Kapil Vaidya, Dominik Horn +2
In this work, we aim to study when learned models are better hash functions, particular for hash-maps. We use lightweight piece-wise linear models to replace the hash functions as…
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…