JoinGR is a join‑aware table retrieval method that treats a database’s join graph as the retrieval space. It represents columns as graph nodes and both intra‑table and foreign‑key relationships as typed edges, then selects anchor tables, traverses join edges with a query‑conditioned scorer, and aggregates edge deposits into table scores. Experiments on BIRD, Spider, and BEAVER show that JoinGR matches or surpasses strong retrieval baselines, especially improving recall on multi‑hop table requirements, and its learned scorer transfers across benchmarks, indicating reusable join‑graph traversal behavior.
By Sandipan De, Abhijit Chakraborty, Sambaran Bandyopadhyay, Vivek Gupta
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:2606. 29532v1 Announce Type: cross Abstract: Integrating unstructured data into relational database systems is increasingly important as demand grows for natural language querying and analysis.
By Christopher Gou, Aditya Banerjee, Jiaxuan Wang, Chunwei Liu
The paper introduces QCOC, a method for compressing the key‑value cache used in tabular in‑context learning. QCOC clusters in‑context example states into joint‑KV prototypes, calibrates them against query vectors, and preserves multiplicities to maintain accuracy while achieving high compression. Experiments on 64 OpenML‑CC18 datasets and seven long tables show QCOC outperforms other compression and retrieval methods, achieving up to a 10.5× compression ratio and 508× speed‑up over dynamic retrieval baselines while staying within 0.23 percentage points of full‑context accuracy.
By Xu Zhao, Jiaming Zhao, Bin Zhao, Yong Yang
MetaJoin is a label‑free framework that adaptively selects join methods for heterogeneous tables by first choosing an initial specialist based on input evidence and then validating or repairing the result using specialist‑specific output evidence. It introduces MNN Join, a transformation specialist that finds string transformations by maximizing mutual‑nearest‑neighbor coverage and uses reciprocal validation. Evaluated on 670 datasets, MetaJoin achieves a macro row‑F1 of 0.817, surpassing a benchmark oracle and outperforming other label‑free policies by over 0.13, while MNN Join dominates all transformation baselines on 609 transformation‑heavy datasets.
By Ning Wang, Sainyam Galhotra
arXiv:2609.26658v1 Announce Type: cross
Abstract: Integrating heterogeneous datasets within data lakes is a critical challenge, particularly for semantically related tables that lack the explicit att...
By Md Ataur Rahman, Dimitris Sacharidis, Oscar Romero, Sergi Nadal
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.
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
arXiv:2607. 22622v1 Announce Type: cross Abstract: Recent Text-to-SQL methods rely heavily on reasoning-centric paradigms such as Chain-of-Thought (CoT), achieving substantial gains on complex benchmarks at the cost of high inference-time overhead.
By Soohyuk Jang, Jiheum Yeom, Nohil Park, Sang Hun Kim, Yoonyoung Choi, Kiwook Bae, Sungroh Yoon
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
The paper introduces DRAG, a query‑adaptive framework that jointly selects retriever and generator configurations for Retrieval‑Augmented Generation (RAG) systems. Two variants are presented: DRAG_QPP, a training‑free routing method using Query Performance Prediction and perplexity signals, and DRAG_SFT, a supervised approach that fine‑tunes an LLM to predict configurations. Experiments on three LLM families and four QA benchmarks show that DRAG_QPP matches strong static baselines while cutting inference latency, and DRAG_SFT consistently outperforms both static and training‑free adaptive baselines, demonstrating a better effectiveness‑efficiency trade‑off.
By Neeraj Anand, Payel Santra, Partha Basuchowdhuri, Debasis Ganguly, Sumit Bhatia
arXiv:2506. 18421v3 Announce Type: replace-cross Abstract: The majority of data in businesses and industries is stored in tables, databases, and data warehouses.
By Ce Li, Xiaofan Liu, Zhiyan Song, Ce Chi, Boshen Shi, Chen Zhao, Guanguang Chang, Zhendong Wang, Kexin Yang, Xing Wang, Chao Deng, Junlan Feng