- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
HCVR reframes multi-table retrieval from similarity scoring to role assignment (provider/connector/none) through a three-stage pipeline (Hypothesize → Compose → Verify) that requires no training. It achieves large gains in Precision and F1 over all baselines on pooled BIRD/Spider/MMQA and leads downstream execution accuracy.
Critical strengths
S1. The role-based paradigm is a clean and principled departure from existing scoring methods. Instead of asking “how similar is this table to the query?”, HCVR explicitly asks “what job does this table do?” — a distinction that directly addresses the core failure mode of prior work: retaining many relevant-looking but ultimately useless tables.
Critical weaknesses
W1. Perfect Recall (PR) is not improved by HCVR and in fact lags behind CORE-T in several settings (e.g., 84.6 vs 87.0 on BIRD/Qwen; 93.0 vs 94.9 on Spider/Qwen, Table 1). For NL2SQL, missing even one gold table makes correct SQL execution impossible, so a method that does not enhance PR limits its downstream benefit. This undermines the paper's central claim that "precise retrieval helps SQL generation without sacrificing coverage" — since coverage (recall) is precisely what is sacrificed in the settings where it matters most.
W2. Methodological novelty is limited. Every component (LLM decomposition, dense retrieval, beam search, LLM verification) is off-the-shelf. The contribution is essentially a workflow design rather than a new algorithm. The paper would benefit from introducing a novel technique at one of the stages.
Questions for authors
Q1. Would HCVR still improve over end-to-end NL2SQL systems with built-in schema linking (e.g., CHESS)?
Q2. The method introduces several hyperparameters (beam width K=10, weight α=0.5, compatibility threshold τ=0.3, max hop h=5). Are the results sensitive to these choices? Was any systematic sensitivity analysis performed?
Q3. Has the paper considered latency or other computational costs? HCVR requires 2.5–2.8 LLM calls per query. How does this overhead affect practical deployability, especially under latency-sensitive scenarios?