arXiv (OAI Expanded)
open access
Calibrated Bayesian Selection of Schema Subgraphs for Database Question Answering
An LLM answering a question about a relational database must know which tables hold the information. Showing too few makes the question unanswerable, while showing too many wastes context. Most schema-linking methods score each table alone, though the required tables are usually connected by foreign
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- CORE-T: COherent REtrieval of Tables for Text-to-SQL#248638
- TELLER: Dual-Path Iterative Preference Optimization for Table Entity Linking#1129347
- BIRD-History: A Benchmark for History-Driven Text-to-SQL with Fine-Grained Knowledge Annotations#794145
- BIRD-History: A Benchmark for History-Driven Text-to-SQL with Fine-Grained Knowledge Annotations#790126
- PremiseSQL: Evaluating Premise Critique and Abstention in Text-to-SQL Systems#1357813
Record · ID 1361491
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive