activity
20162025
most citedBounding the Last Mile: Efficient Learned String Indexing

7 citations · 15 across the 5 of their papers we have counts for

collaborators

8 papers

cs.CL2025

SQLens: An End-to-End Framework for Error Detection and Correction in Text-to-SQL

Yue Gong, Chuan Lei, Xiao Qin +3

Text-to-SQL systems translate natural language (NL) questions into SQL queries, enabling non-technical users to interact with structured data. While large language models (LLMs) ha…

cs.DB2025★ 1 cited

TailorSQL: An NL2SQL System Tailored to Your Query Workload

Kapil Vaidya, Jialin Ding, Sebastian Kosak +7

NL2SQL (natural language to SQL) translates natural language questions into SQL queries, thereby making structured data accessible to non-technical users, serving as the foundation…

cs.DB2025★ 1 cited

ODIN: A NL2SQL Recommender to Handle Schema Ambiguity

Kapil Vaidya, Abishek Sankararaman, Jialin Ding +4

NL2SQL (natural language to SQL) systems translate natural language into SQL queries, allowing users with no technical background to interact with databases and create tools like r…

cs.DB2021★ 7 cited

Bounding the Last Mile: Efficient Learned String Indexing

Benjamin Spector, Andreas Kipf, Kapil Vaidya +3

We introduce the RadixStringSpline (RSS) learned index structure for efficiently indexing strings. RSS is a tree of radix splines each indexing a fixed number of bytes. RSS approac…

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…

cs.PL2016

Data-centric Dynamic Partial Order Reduction

Marek Chalupa, Krishnendu Chatterjee, Andreas Pavlogiannis +2

We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating…