- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes HiR-MKR for question answering over complex semi-structured tables. Starting from ST-Raptor’s HO-Tree, the method uses TAHRA to reconstruct explicit parent–child hierarchy from field statistics, then builds a knowledge graph, a Record vector store, and a Path vector store from the hierarchy-enhanced tree. For each question, an LLM decomposes it into subquestions, predicts their types and dependencies, and selects knowledge sources accordingly for retrieval and reasoning. The authors report improved accuracy over the compared methods on WikiTQ-ST, TempTabQA-ST, and SSTQA, as well as lower online response time and token consumption than ST-Raptor on SSTQA.
Critical strengths
S1.The paper addresses an important problem in semi-structured table question answering, where hierarchical layouts and complex structural relationships introduce challenges for retrieval and reasoning. S2.The methodological distinction from the closest HO-Tree baseline is clear. The paper specifically moves from implicit path/topological semantics to explicit hierarchical nodes and edges, and uses them as a shared basis for KG, Record, and Path representations, rather than merely adding a generic retriever on top of an HO-Tree S3.The results show consistent empirical improvements. In Table 1, HiR-MKR exceeds ST-Raptor on all three benchmarks. Table 2 further shows lower SSTQA accuracy after removing TAHRA, KG retrieval, query decomposition, or reliability assessment. These findings provide positive evidence for the full pipeline and several major components.
Critical weaknesses
W1. The text states that the original HO-Tree is retained when all candidate fields have the same unique-value count and delta_S < 0.05. However, Algorithm 1 returns S, F, although its second output is defined as hierarchy order L. The manuscript does not specify whether this returned value is a special no-hierarchy indicator, whether Algorithm 2 is skipped, or how it is mapped to Algorithm 2’s input L. It is therefore unclear whether aggregation is actually performed after the conservative test is triggered. The paper should also clarify whether the candidate-field set F in Algorithm 1 and the complete field set F used to preserve non-hierarchical attributes in Algorithm 2 are the same object. W2. TAHRA is a core component of the paper. While the end-to-end ablation in Table 2 indicates that it improves final accuracy on SSTQA, the paper does not report agreement between the reconstructed hierarchical fields and human annotations or the semantic structure of the original tables. Therefore, the current experiments support TAHRA’s empirical contribution to the overall pipeline, but do not directly validate whether the claimed explicit hierarchy reconstruction is accurate or clarify its applicability across different table structures. This limits assessment of the proposed mechanism and its ability to recover structural semantics. W3. Table 2 reports only an ablation without KG retrieval; it does not separately evaluate the Record or Path vector store, nor compare type-aware retrieval with a unified or simpler retrieval strategy. Thus, the experiments support the contribution of KG retrieval to the full system, but do not quantify the independent benefits of Record retrieval, Path retrieval, or their coordinated routing, nor establish whether the three-source design is necessary relative to simpler alternatives. W4. Table 3 measures only the online QA stage and treats KG/vector-store construction as offline cost, without reporting preprocessing time, token consumption, or hardware/service conditions. W5. Appendix A.5.1 notes that HiR-MKR underperforms ST-Raptor on simple questions (87.68% vs. 93.97%) possibly because additional retrieval and reasoning introduce unnecessary processing, but this explanation is not supported by concrete error cases or quantitative attribution. The paper would benefit from a small number of representative success and failure cases showing reconstructed structures, retrieved evidence, and error sources, which would better clarify the mechanism and applicability boundary.
Questions for authors
1.When the conservative test in Algorithm 1 is triggered, what exact value is passed as L to Algorithm 2, and is Algorithm 2 executed? Please also clarify whether F denotes the same field set in Algorithms 1 and 2. 2.Can the authors provide a direct evaluation of TAHRA’s reconstructed hierarchy, e.g., hierarchical-field ordering or parent–child relation accuracy on a manually checked subset? 3.What are the individual contributions of the Record vector store, Path vector store, and type-aware source routing? Could the authors report ablations or comparisons against simpler retrieval configurations? 4. What are the preprocessing time, token/API cost, and hardware or service settings for HO-Tree reconstruction, TAHRA, and KG/vector-store construction?