Table–Text question answering asks systems to answer natural-language questions whose evidence is split between structured tables and linked unstructured passages. Many realistic questions in this setting are coverage-sensitive: the answer depends on a set of evidence items distributed across table rows and linked passages, and the same failure mode that appears in aggregation also surfaces in joins, multi-row filters, list questions, and universal or existential queries. Existing hybrid systems retrieve and read such evidence, yet leave passage-derived facts as strings in the LLM context rather than as typed, joinable, and repairable relational values that SQL can operate on. We propose TRACE (Table–Text Relationalization And Completion of Evidence), a completeness-aware query-processing framework built on two relational state transformations. Schema-Guided Relationalization (SGR) turns linked passages into typed, foreign-keyed side tables, exposing textual evidence as SQL-visible relational values; Question-Conditioned Relational Completion (QCRC) then repairs this state per question by adding missing attributes and filling incomplete cells. SQL performs set-oriented operations over the completed state, while a lightweight passage fallback handles residual gaps. On the coverage-sensitive SPARTA benchmark, TRACE more than triples the strongest baseline F1 (60.5 vs. 19.2 with gpt-4o-mini); on lookup-heavy HYBRIDQA, it stays competitive while substantially reducing the drop on questions that require many evidence items.