Reflect‑SQL is a new framework for converting natural language into SQL queries. It tackles challenges such as large, obscure database schemas, poor table and column retrieval, and syntactically or logically flawed SQL by using a multi‑stage self‑reflection approach. The system iteratively refines queries and SQL through feedback loops driven by an LLM‑as‑a‑judge, achieving 72.03% execution accuracy on the BIRD benchmark, outperforming existing baselines.
By Anupreksha Jain, Manish Shrivastava
arXiv:2606. 15598v1 Announce Type: new Abstract: Text-to-SQL aims to translate natural language questions into executable SQL queries over structured databases, enabling non-expert users to access data intuitively.
By Feng Lyu, Jinfeng Cen, Sijing Duan, Hao Wu, Shucheng Li, Weixu Zhang, Haolun Wu
arXiv:2609.08950v1 Announce Type: cross
Abstract: Text-to-SQL systems translate natural language queries into executable SQL, democratizing access to structured data. Despite recent advances driven b...
By Mohammadhossein Malekpour, Mohamed Riahi, Maxime Lamothe, Amine Mhedhbi
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:2606. 08018v1 Announce Type: new Abstract: Existing text-to-SQL benchmarks are largely centered on SQLite, making it difficult to evaluate whether models can generalize across heterogeneous SQL dialects.
By Jianling Gao, Chongyang Tao, Jiayuan Bai, Liu Yang, Xuanguang Pan, Jinrui Liu, Shihao Xing, Xiaohan Xu, Jie Liang, Shuai Ma
arXiv:2610.03625v1 Announce Type: cross
Abstract: Relational databases are among the most widely deployed forms of structured knowledge, and natural language access to them requires grounding languag...
By Darian Lee, Shannon Rumsey, Jack St. Clair, Xinyi Tang, Aditya Bansal, Yuanming Shi
arXiv:2607. 06482v1 Announce Type: cross Abstract: Current benchmarks for evaluating Large Language Models (LLMs) in data analysis often fail to reflect real-world settings.
By So Hasegawa, Shailaja Keyur Sampat, Lei Liu, Wei-Peng Chen
arXiv:2609.21133v1 Announce Type: cross
Abstract: SQL has been augmented with AI operators, enabling modern data analytics platforms to derive insights from both structured and unstructured data. We...
By Tarfah Alrashed, Fatma Ozcan, Per Jacobsson, Tal Neiman, Xianshun Chen
arXiv:2606. 28601v1 Announce Type: cross Abstract: Recent progress in Text-to-SQL has been driven by stronger language models and prompting strategies, yet performance on real enterprise benchmarks such as Spider 2.
By Jingwen Liu, Weibin Liao, Xin Gao, Junfeng Zhao, Yasha Wang
SPARQL-LLM is an open‑source, triplestore‑agnostic system that generates SPARQL queries from natural language using lightweight metadata and dedicated components for indexing, prompt building, and execution. It achieves up to 59 % higher F1 scores than the next best system on a multilingual challenge and on bioinformatics knowledge graphs, while being up to 27 × faster and costing no more than $0.01 per question. The project is publicly available on GitHub and is already deployed on real‑world decentralized knowledge graphs such as expasy.org/chat.
By Panayiotis Smeros, Vincent Emonet, Ruijie Wang, Ana-Claudia Sima, Tarcisio Mendes de Farias
The paper introduces EXYGEN, a framework that enables conversational access to large knowledge graphs by combining VoID descriptions, ShEx schemas, retrieved triples, and example question‑query pairs in a retrieval‑augmented generation pipeline. On the SciQA benchmark, this approach achieves an exact‑match score of 0.419 without fine‑tuning any large language model, and shows that larger general‑purpose LLMs can outperform smaller code‑specialized ones when provided sufficient context. To scale metadata generation for very large KGs, the authors propose a predicate‑coverage‑aware parallel graph sampling strategy that preserves structural diversity, reduces runtime by over 80× on OpenCitations Meta and GESIS, and is the only tractable method for obtaining complete metadata on ORKG.
By Harshdeep Singh, Yurui Zhu, Giovanni Colavizza, Matteo Romanello
arXiv:2607. 18029v1 Announce Type: cross Abstract: Researchers need to answer ad-hoc questions about the contents of domain-specific archives but often lack the expertise to write structured queries on the metadata.
By Blake G. Fitch, Cato Elia Kurtz