- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes SAG, a SQL-augmented retrieval pipeline that leverages query-time dynamic hyperedges to improve multi-hop retrieval. The pipeline consists of two main stages:
-
Offline indexing: An LLM summarizes each chunk into an event and extracts the associated entities. Events and entities are linked through many-to-many relationships stored in a SQL database.
-
Online retrieval: SAG combines structured retrieval with query-based vector retrieval. Specifically, an LLM first extracts entities from the query, which are then used to retrieve associated events through SQL joins. In parallel, the query is embedded to retrieve semantically relevant events. The retrieved events are further expanded through shared entities, and the resulting candidate pool is ranked by query-event similarity to retain the top 100 events. An LLM then selects five events, which are mapped back to their original chunks. Finally, direct vector retrieval supplements these selected chunks with five additional, non-overlapping chunks, yielding ten chunks for answer generation.
Experiments on several multi-hop QA benchmarks demonstrate that SAG consistently outperforms the evaluated baselines.
Critical strengths
-
The paper is well written, clearly organized, and easy to follow.
-
The proposed pipeline represents a reasonable engineering approach to combining structured retrieval and dense retrieval.
Critical weaknesses
-
Missing references. Several relevant studies are not adequately discussed. In particular, [1, 2] also propose structure-augmented RAG approaches and should be included in the related work to better position the contributions of SAG.
-
Concerns about comparison fairness. The experimental comparisons do not adequately control for differences in candidate retrieval and reranking budgets. SAG retrieves and expands a relatively large candidate pool before employing a powerful LLM to select the final evidence, whereas the dense retrieval baselines do not appear to benefit from an equivalent selection process. Consequently, part of the reported improvements may be attributable to the larger candidate pool and stronger reranking rather than the proposed structural representation. This makes it difficult to isolate the effectiveness of the core method.
-
Limited methodological novelty. The proposed method appears to be primarily an engineering integration of existing techniques, including entity-based indexing, structured retrieval, graph-style expansion through shared entities, and LLM-based evidence selection. While using SQL to implement these operations may offer practical advantages, the methodological novelty beyond existing structure-augmented retrieval approaches is not sufficiently established.
[1] LinearRAG: Linear Graph Retrieval Augmented Generation on Large-scale Corpora, Zhuang et. al, ICLR 2026.
[2] E$^2$GraphRAG: Streamlining Graph-based RAG for High Efficiency and Effectiveness, Zhao et.al, Arxiv preprint.
Questions for authors
-
Comparison with stronger dense retrieval baselines. What happens if the dense retrieval baselines are allowed to retrieve a larger candidate pool (e.g., top 100) and employ the same LLM-based evidence selector as SAG? Would SAG still maintain its performance advantage under this setting?
-
Analysis of structural retrieval gains. Could the authors provide a detailed analysis of how many gold supporting passages are recovered by SAG's structural expansion but are absent from the top 100 candidates retrieved by dense retrieval? Such an analysis would help distinguish improvements in candidate coverage from those attributable to LLM-based reranking.
2 comments
Response to Reviewer YkW4 (2/2)
W3. Methodological novelty
"The proposed method appears to be primarily an engineering integration of existing techniques … the methodological novelty beyond existing structure-augmented retrieval approaches is not sufficiently established."
SAG's contribution is how entity structure is used in retrieval, a design that differs from the closest graph methods, including LinearRAG named by the reviewer and HGRAG, the closest hypergraph design. The individual components are standard building blocks; the design that combines them is what produces the gains below.
1. Structure decides which candidates exist; it never enters the ranking score. LinearRAG and HGRAG propagate scores from the query entities over an entity graph (Personalized PageRank, hypergraph diffusion) and rank every passage by one global score, so a passage's rank depends on how much score reaches it from the query entities. In SAG, structure has a single job: a bounded one-hop expansion from the events already retrieved, along shared entities, with its size fixed by , , and . Candidates are then ordered by query–event similarity alone, so the number of hops between a passage and the query entities does not affect its rank.
2. This design directly targets limitations the two papers state themselves.
- Expansion growth. LinearRAG notes "the exponential growth of the search space as propagation deepens" (§3.2.1). SAG expands one hop with fixed budgets: on MuSiQue, LinearRAG activates 666 entities per query and adds entity scores to a median of 10,595 of the 11,656 passages, while SAG ranks at most 100 candidate passages.
- Drift. LinearRAG notes that "irrelevant entities may repeatedly serve as new seeds … drift into semantic regions unrelated to the original query intent" (§3.2.1). In SAG, expanded entities never become new seeds, frontier entities are chosen by the relevance of their role descriptions to the query, and all candidates are re-ranked by similarity to the query.
- Long reasoning chains. HGRAG notes that on datasets "such as MuSiQue requiring longer reasoning hops, structural modeling is more prone to incompleteness and errors." SAG's ranking contains no propagated score and no diffusion-step parameter, and one default configuration serves all three datasets, whereas HGRAG tunes its diffusion steps and weights per dataset.
3. The effect: deep evidence is ranked higher. We replayed both methods' scoring with their released code and grouped gold passages by their graph distance from the query's seed entities. For passages three or more steps away, the similarity term inside each method places 30.1% (HGRAG) and 39.0% (LinearRAG) in the top 5; after propagation, only 2.3% and 6.7% remain there. The same passages reach 35.4% and 38.1% in SAG's candidate order, because their distance does not change their rank.
4. Result on multi-hop evidence (MuSiQue; SAG's candidate order before the LLM selector, versus each method's final ranking):
| Evidence (MuSiQue) | Passages | Method | Top-5 | Top-20 | Top-50 |
|---|---|---|---|---|---|
| Depth 3 (requires answering two prior hops) | 409 | SAG | 40.3 | 63.8 | 75.3 |
| LinearRAG | 22.5 | 46.2 | 65.8 | ||
| HGRAG | 20.0 | 40.6 | 59.4 | ||
| Last hop of 3/4-hop questions (holds the answer) | 482 | SAG | 39.8 | 66.4 | 79.3 |
| LinearRAG | 24.9 | 50.2 | 70.1 | ||
| HGRAG | 26.1 | 46.1 | 62.9 |
The 420 gold passages that SAG ranks below position 20 all enter its candidates through the entity path (116) or the one-hop expansion (304), which is where the structure contributes.
The other two design properties support this contribution: event-level units preserve the n-ary relation of each chunk (replacing them with triples lowers R@5 by 2.75 / 9.24 / 13.80 and F1 by 9.95 / 3.65 / 6.80 on MuSiQue / 2Wiki / HotpotQA, Table 2), and the index is append-only, so new documents add rows without changing existing records.
Protocol. All methods use BGE and the same corpora, with the hyperparameters from their papers. With its threshold raised to 0.4, LinearRAG reaches 55.25 R@5 on a 200-query subset. HGRAG's reported 74.1 R@5 on MuSiQue uses NV-Embed-v2 and Llama-3.3-70B; under this shared protocol it reaches 58.98.
We thank the reviewer again. The revised paper adds the requested references and baselines. This response adds a controlled comparison with equal candidate pool and selector, and shows that SAG's contribution is a design in which structure assembles candidates while ranking follows relevance to the query.
Response to Reviewer YkW4 (1/2)
We thank the reviewer for finding the paper well written and the pipeline a reasonable combination of structured and dense retrieval. The new references and baselines are in the revised PDF; the other experiments are reported for this discussion.
W1. LinearRAG and E²GraphRAG
Both are now discussed in Related Work and evaluated as baselines in Table 1, Table 3, and the appendix, together with HGRAG, BrowseNet, and SiReRAG. All methods use the same corpora, encoder (BGE), and reader. E²GraphRAG and SiReRAG return summary nodes or unordered sets, so we report QA for them.
W2 + Q1 + Q2. Candidate-pool and selection budgets; gold passages beyond dense top-100
SAG maintains its advantage over dense retrieval with the candidate pool and selector equalized, and is on par with HippoRAG 2. On MuSiQue (1,000 queries), every system supplies 100 candidates, and the same Qwen3.6-Flash selector, prompt, and truncation choose 5:
Final evidence: 5 passages chosen by the selector.
Candidate coverage: measured on each method's ranked candidates before the selector is applied.
Gold passages beyond dense top-100 (Q2). With the selector held fixed, candidate coverage and final recall move together, so the gain comes from candidate coverage rather than from reranking. The additional gold passages are reached by hop-by-hop expansion through shared entities, which dense similarity to the question does not rank highly.
The ranking-and-pruning design is what separates SAG from methods that expand from their seeds in one pass over the corpus graph, and its effect is largest on evidence deep in the reasoning chain (see W3 in the next comment).