text2ql is an open‑source Python framework that enables natural language querying of databases without relying on large language models at query time. It uses a language‑agnostic intermediate representation (QueryIR) and a pluggable renderer to support both SQL and GraphQL targets through a single seven‑stage detection pipeline. In deterministic mode, it achieves 100% execution accuracy with a median latency of 3.2 ms, while the LLM‑backed mode delivers 62‑70% exact match and 84‑91% execution accuracy on benchmark samples.
By Ritesh Kumar
arXiv:2602. 11745v2 Announce Type: replace Abstract: Graph models are fundamental to data analysis in domains rich with complex relationships.
By Songlin Lyu, Lujie Ban, Zihang Wu, Tianqi Luo, Jirong Liu, Ayoub Moussaid, Oskar van Rest, Heng Lin, Chenhao Ma, Nan Tang, Shipeng Qi, Yongchao Liu, Zhan Qiu, Juelu Zhang, Jiajun Zheng
Build2SPARQL is a large-scale benchmark dataset for translating natural-language questions into SPARQL queries over building knowledge graphs. The dataset is generated by a KG‑grounded pipeline that produces 6,136 executable SPARQL queries and 30,680 corresponding natural-language questions across six query-pattern families and five vocabulary registers, covering 201 building KGs. Human validation shows high semantic fidelity, naturalness, and operational plausibility, and retrieval‑augmented evaluation demonstrates significant accuracy gains for open‑weight language models.
By Wooyoung Jung
arXiv:2610.02770v1 Announce Type: new
Abstract: Document databases such as MongoDB are core infrastructure for modern applications, and natural-language interfaces to them---text-to-MQL---would let n...
By Hy Nguyen, Nabi Rezvani, Robin Vujanic
arXiv:2607. 06229v1 Announce Type: cross Abstract: Major cloud data platforms now expose large language model capabilities as native SQL functions, enabling analysts to perform classification, filtering, sentiment analysis, extraction, similarity search, and aggregation within ordinary SQL queries.
By Tianyang Liu, Canwen Xu, Fangyu Lei, Nikki Lijing Kuang, Jixuan Chen, Tao Yu, Julian McAuley, Zhewei Yao, Yuxiong He
The paper introduces QRAKEN, a training‑free, ontology‑agnostic neurosymbolic pipeline that grounds natural‑language queries to RDF knowledge graphs using empirical graph evidence instead of schema expectations. QRAKEN distills a compact TTQL representation offline, then uses it online to guide large language models, providing deterministic checks and an iterative refinement loop. On the CK25 benchmark, QRAKEN achieves a strict F1 of 0.643–0.652 with GPT‑4.1 mini and GPT‑5.4, outperforming state‑of‑the‑art systems and demonstrating the effectiveness of empirical pattern distillation over schema‑only approaches.
By Remo Grillo, Lukas Klic, Giovanni Colavizza
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
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
IndicDBBench is a new multilingual Text-to-SQL benchmark that evaluates cross‑lingual semantic parsing across 20 databases and 237 tables in seven languages, including English and six Indic languages. The benchmark uses real‑world open‑data schemas from NDAP and IDP, and a three‑agent pipeline to create complex relational structures with high relational density and join depths up to six. Evaluation of state‑of‑the‑art models shows a 9‑point drop in execution accuracy from English to Indic languages, revealing an "Indic Gap" that persists even when gold tables and literal values are supplied.
By Aviral Dawar, Roshan Karanth, Vikram Goyal, Rakhee Kulshrestha, Sumanta Pasari, Dhruv Kumar
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:2502. 11201v3 Announce Type: replace-cross Abstract: NoSQL databases are core data infrastructure, yet natural-language access to them remains underdeveloped: correct query generation must recover how a non-relational data model represents entities, nested paths, arrays, missing fields, and dynamic keys.
By Jinwei Lu, Jiawei Lu, Chen Zhang, Zhiqian Qin, Haodi Zhang, Yuanfeng Song, Raymond Chi-Wing Wong
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