- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes DBCC, a middleware that compresses the database context for Text-to-SQL. It uses a two-phase approach: offline structural/semantic compression via the SGCF principle, and online query-driven evidence purification. Experiments on Spider 2.0-Snow show substantial reductions in serialized context size and significant improvements in strict recall, with consistent end-to-end gains when plugged into existing systems.
Critical strengths
S1. The problem is well-motivated with a clear compositional analysis (Table 2), showing that over 90% of the serialized database context in large databases is repeated. This diagnosis grounds the method’s design and highlights a real bottleneck.
S2. The compressed view is modular and plug-and-play: it can be inserted into either the linking or generation stage without modifying downstream models. Consistent gains across three different end-to-end systems (AutoLink, ReFoRCE, Apex-SQL) demonstrate practical compatibility.
Critical weaknesses
W1. The method introduces many hyperparameters (e.g., τ_s, τ_w, τ_g, w_max), yet no sensitivity analysis is provided. It is unclear how these thresholds affect the trade-off between compression rate and accuracy, and whether the reported gains are robust across different settings.
Questions for authors
Q1. Could you provide a sensitivity sweep for key thresholds showing how strict recall and token count vary?
Q2. How was Table 2 constructed? Specifically, what rules were used to classify each token into “repeated,” “irrelevant docs,” and “unique task content”?
5 comments
Response to Reviewer Muyx (Part II)
Clarification of Table 2
Thank you for raising this question. We apologize for the omission of the relevant explanation in the original manuscript. Table 2 was constructed from the database-context portion of each evaluated prompt; the user question and prompt instructions were excluded.
- Repeated context includes redundant structural or semantic material. For structural content, we canonicalized column signatures using the column name, type, and structural metadata. If the same column group occurred in multiple tables, one occurrence was retained as the canonical occurrence and the remaining occurrences were counted as repeated. Similarly, for a family of isomorphic tables, one table signature was treated as canonical and the duplicated portions of the other tables were counted as repeated. For semantic content, descriptions were normalized into semantic tags; occurrences of a tag component beyond its first occurrence were counted as repeated. Thus, this category measures removable duplicated material rather than merely counting recurring lexical tokens.
- Irrelevant docs includes tokens from external-document spans that did not support any decision required by the evaluated question. A document span was considered relevant if it provided a mapping to a Gold table or column, a metric or transformation used by the Gold SQL, an encoded filter value, or a domain definition required to interpret the question. All other external-document spans were assigned to this category.
- Unique task content is the residual category: nonduplicated schema definitions, nonrepeated column semantics, and question-relevant document spans. Prompt scaffolding was not included in the denominator.
The assignment order was deterministic: external-document spans were first divided into relevant and irrelevant spans; schema and semantic records were then checked for structural or semantic duplication; all remaining context was labeled as unique task content.
Manuscript Revision Explanation
We would like to once again express our gratitude for your constructive suggestions and acknowledge that the original manuscript has several shortcomings. In response to your feedback, we have revised our manuscript as follows:
-
We added a sensitivity analysis for the component-selection thresholds , , , and , reporting both schema-linking performance and token cost across the Small, Medium, and Large database buckets.
-
We documented the default threshold configuration and explained how increasing each threshold changes the number of retained components, input-token cost, and schema-linking performance.
-
We expanded the construction protocol for Table 2 by defining the mutually exclusive categories of repeated context, irrelevant documents, and unique task content, as well as the deterministic assignment order used to classify the serialized context.
To facilitate quick identification of our modifications, we have highlighted the changes using special colored fonts. Please refer to the Guideline for Reviewers on the last page of the revised manuscript.
We sincerely thank you once again for your thoughtful guidance. Your feedback has been immensely valuable to us, and incorporating your suggestions has significantly improved the quality of our manuscript. If you have any further questions or concerns, please feel free to contact us at any time. We are always available and look forward to further discussions with you.
Best regards,
All Authors of Submission 14265
Kindly Request for Reviewer's Feedback
Dear Reviewer Muyx,
We hope this message finds you well. We completely understand that your schedule may be demanding, and we sincerely appreciate the time and effort you have devoted to reviewing our manuscript.
In response to your thoughtful suggestions and questions, we have carefully prepared a detailed rebuttal that we hope addresses your concerns.
Specifically, following your suggestions, we have made the following revisions:
-
Threshold sensitivity. We varied the support, width, and gain thresholds one at a time and reported strict recall and input-token count across the Small, Medium, and Large database buckets. Raising these thresholds retained fewer shared components and slightly increased token counts. Schema-linking performance was generally stable across the settings tested, with some variation in strict recall. We also tested maximum component widths of 5, 6, 8, and 10 and observed nearly identical compression results.
-
Construction of Table 2. We clarified that the percentages use only the database-context portion of each prompt. We first classified external-document spans by whether they supplied evidence needed to answer the question. We then identified repeated schema structures and normalized semantic components, counting occurrences beyond the first as repeated. The remaining material was classified as unique task content. The revision documents this assignment order and the criteria for each category.
We are eager to understand whether our efforts have effectively addressed the limitation in the original manuscript. Given your expertise, we are eager to engage in further discussion with you. However, as the discussion phase draws to a close (with less than 24 hours remaining), we have yet to receive your response. If possible, we would be deeply grateful if you could spare a moment to share your thoughts, which would be of immense value to us.
Thank you again for your time, thoughtful feedback, and invaluable guidance.
Warmest regards,
All Authors of Submission #14265
Response to Reviewer Muyx (Part I)
We sincerely thank you for acknowledging the strong motivation, modular compressed representation, and plug-and-play design of our work. We deeply value the constructive criticisms you raised and respond to each concern in detail below.
Sensitivity Analysis of Compression Thresholds
Thank you for raising this question. We apologize for not including a sensitivity analysis of DBCC's key hyperparameters in the original submission. We evaluate the sensitivity of schema linking to the four component-selection thresholds (τs,τw,τg,wmax), which respectively control the minimum support, minimum width, minimum gain, and maximum width of a selected component. The results are summarized in the following table.
The default setting is (τs,τw,τg,wmax)=(2,2,1,6). We first compared wmax∈{5,6,8,10}. These settings produced almost identical compression results. This saturation is consistent with the structure of the input: keyword sets are short and the width of shared components is limited. At wmax=6, all practically available shared components are already covered, so increasing the limit does not improve the compression ceiling and only increases the number of candidate combinations considered. We therefore fix wmax=6 in the remaining experiments.
The thresholds τs, τw, and τg impose lower bounds on the support, width, and gain of a selected component. Smaller thresholds admit smaller and more fragmented components. Such components can still provide a useful aggregate token reduction even when the saving from an individual component is limited. We therefore use (2,2,1) as the default: each threshold is set to its minimum, allowing the compressor to retain all components that may contribute to the total reduction.
We sweep one threshold at a time while keeping the other two at their default values. Specifically, τs and τw take values in {2,3,4,6}, while τg takes values in {1,2,4,6}. The default configuration is shared by the three sweeps and is reported only once in the first row.
As the thresholds increase, a small number of components with low support, narrow scope, or limited gain are filtered out. Overall, the schema-linking metrics remain relatively stable across the three database-size buckets, while the input token count increases slightly because fewer components are retained for compression. These results show that the compression pipeline is robust to reasonable threshold choices, while the default setting preserves the largest set of potential compression opportunities.