arXiv Machine Learning By Leonard Traeger, Enas Khwaileh, Andreas Behrend, George Karabatis

RACT: Retrieval Augmented Column-Table Learning and Prediction for Multi-Table Schema Matching

Read the original on arXiv Machine Learning →

arXiv:2606. 07843v1 Announce Type: cross Abstract: Schema matching, a critical task for integrating data from diverse sources, seeks to identify correspondences between columns across different schemas.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

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 17

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.

By Karime Maamari, Fadhil Abubaker, Daniel Jaroslawicz, Amine Mhedhbi
arXiv AI
Oct 5

From Benchmarks to Production: A Text-to-SQL System for Complex Financial Data

The paper introduces FLINT, a domain‑specialized Text‑to‑SQL system designed for complex financial databases where data is stored as opaque integer keys. FLINT employs a lookup agent to resolve natural‑language concepts, uses embedding‑based retrieval of query templates from a compact expert‑authored bank, and prunes large schemas by traversing foreign‑key chains. Evaluated on 359 questions across two production financial schemas, FLINT outperforms state‑of‑the‑art baselines and is already deployed in a financial data retrieval service.

By Arijit Sehanobish, Bruno Gomes Coelho, Guillaume Michel, Sophia Zhi, Valerie Faucon-Morin, Kristen Howell
arXiv Machine Learning
Sep 4

Towards Universal Tabular Embeddings: A Benchmark Across Data Tasks

The paper introduces TEmBed, a unified benchmark for evaluating tabular embeddings across four representation levels—cell, row, column, and table—using a diverse set of models. It demonstrates that the best model depends on the specific task and representation level, providing practical guidance for selecting embeddings in real-world applications. The study aims to facilitate the development of more general-purpose tabular representation models.

By Liane Vogel, Kavitha Srinivas, Niharika D'Souza, Sola Shirai, Oktie Hassanzadeh, Horst Samulowitz