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 keys and can include connectors matching the question only weakly. We develop a hierarchical Bayesian model that combines question evidence with the foreign-key graph and returns empirically near-calibrated probabilities over complete sets of tables, not a single list, so later stages can tell when a selection is uncertain. Schema graphs are small enough to evaluate every subset exactly. With a fixed context budget the graph improves the chance of retaining every required table, and the benefit grows with schema size, turning positive at about seven tables. When the model also chooses how many tables to keep, a learned prior on subset size accounts for the whole improvement and the graph adds nothing. Fit the size prior first, and use the graph when the budget is fixed. The model's predictive sets cover the true set about as often as promised, where independent scoring is overconfident.

翻译：暂无翻译