arXiv AI

The Death of Schema Linking? Text-to-SQL in the Age of Well-Reasoned Language Models

The paper examines the role of schema linking in Text-to-SQL systems and finds that recent large language models can effectively use relevant schema elements even when many irrelevant ones are present. Consequently, the authors eliminate schema linking when the entire schema fits within the model’s context window, instead employing augmentation, selection, and correction techniques to enhance accuracy. Their approach achieves first place on the BIRD benchmark with a 71.83% accuracy.

arXiv AI
Sep 15

Beyond Quacking: Deep Integration of Language Models and RAG into DuckDB

The paper introduces FlockMTL, an extension for database management systems that deeply integrates large language models and retrieval‑augmented generation into DuckDB. It provides model‑driven scalar and aggregate functions, cost‑based optimizations like batching and caching, and new SQL DDL abstractions (PROMPT and MODEL) to treat LLMs as first‑class schema objects. These features aim to simplify the development of knowledge‑intensive analytical applications by reducing the effort required to orchestrate heterogeneous data systems and manage LLM context.

By Anas Dorbani, Sunny Yasser, Jimmy Lin, Amine Mhedhbi
Hugging Face Trending Papers
Jul 14

Finding the Right Tables and Columns: A Benchmark and Corpus-Adaptive Embeddings for SQL Schema Retrieval

Retrieval in the SQL setting has largely been studied as the task of finding, within a large collection of SQL statements, the statement that answers a natural-language question. At scale, however, a more fundamental retrieval problem precedes generation: schema retrieval, identifying the tables and columns a question requires in a database that may contain thousands of them, far more than fit in a model's context.

arXiv AI
Sep 2

Replacing Training with Memory: Listwise Selection for Text-to-SQL

The paper proposes a fine‑tuning‑free listwise selector for Text‑to‑SQL systems that replaces traditional learning objectives with inference‑time strategies. It introduces reusable structured memories (MaP‑SQL) that encode mappings from natural language to schema elements, SQL operations, and expected outputs, and uses these memories to evaluate candidate queries. To reduce positional bias, the method aggregates rankings across multiple input permutations, optimizing inference cost through execution results and pointwise scoring. The approach achieves higher selection accuracy, fewer unnecessary comparisons, and outperforms the prior state‑of‑the‑art R^3‑SQL on the BIRD‑dev benchmark while using fewer tokens.

By Yeonseok Jeong, Soyoung Yoon, Seongjun Lee, Seung-won Hwang
arXiv Machine Learning
1d ago

STEER: Reducing Inference Cost in Relational Foundation Models through Semantically Informed Sampling

STEER is a sampling method for relational foundation models that reduces inference cost by focusing on the most relevant tables for a prediction task. It uses a large language model to rank foreign‑key edges in the database schema into relevance tiers, then assigns traversal probabilities based on these tiers. Evaluated on three state‑of‑the‑art RFMs, STEER cuts inference context size by roughly 40% on average while preserving or improving accuracy.

By Abdalla Mohamed, Ashraf Aboulnaga
arXiv AI
Jun 17

Querying an astronomical database using large language models: the ALeRCE text-to-SQL system

arXiv:2606. 18108v1 Announce Type: cross Abstract: We develop a text-to-SQL (structured query language) system based on large language models (LLMs) using in-context learning and apply it to the Automatic Learning for the Rapid Classification of Events (ALeRCE) astronomical database.

By P. A. Estevez, J. Espejo-Moreira, S. Sanfeliu-Alvarez, F. Forster, A. M. Munoz Arancibia, G. Cabrera-Vives, F. E. Bauer, A. Bayo, M. Catelan, R. Dastidar, L. Hernandez-Garcia, J. A. Intriago, G. Pignata