arXiv:2608.12129cs.CL2026-08被引 1

SAG让大模型在问答时动态构建事件关联,无需预建知识图谱。

SAG: SQL-Retrieval Augmented Generation with Query-Time Dynamic Hyperedges

论文配图:SAG: SQL-Retrieval Augmented Generation with Query-Time Dynamic Hyperedges
图 1 · 摘自论文原文
  • 用事件-实体结构化文档,查询时通过共享实体动态连接相关片段。
  • 在多跳推理任务上表现最优,MuSiQue数据集召回率高达80.36%。
  • 适合需要持续更新的组织级知识检索与复杂推理场景。

尽管检索增强生成(RAG)已证明能为大语言模型提供外部知识访问,主流密集检索方法在处理结构化约束和多跳推理方面仍存在固有限制。基于图的方法虽能缓解此问题,但通常会碎片化语义、维护成本高且难以增量更新。本文提出SAG(SQL-Retrieval Augmented Generation),一种结构化检索架构,将文档组织为事件-实体索引,不构建全局知识图谱。每个文本块被表示为包含其语义完整事件及其实体的潜在超边,保留n元关系而不分解为三元组。查询时,共享实体作为连接键,动态生成针对当前查询的事件邻域,同时每条证据始终保留原始文本块形式。在HotpotQA、2WikiMultiHopQA和MuSiQue上的实验表明,SAG在所有基准测试中均取得最佳检索与端到端问答性能,且随着推理链复杂度提升,优势更加显著。在对多跳证据链要求最高的MuSiQue上,SAG达到80.36% Recall@5,优于最强基线11.52个百分点。该工作为支持大模型智能体持续获取与推理组织知识的知识基础设施开辟了新路径。

原文摘要 · Abstract (English)

While retrieval-augmented generation (RAG) has proven effective at giving LLMs access to external knowledge, mainstream dense-retrieval implementations remain inherently limited in handling structured constraints and multi-hop reasoning. Graph-based methods address this by constructing knowledge graphs offline, but they often fragment semantics, incur high maintenance, and complicate incremental updates. We propose SAG (SQL-Retrieval Augmented Generation), a structured retrieval architecture that organizes documents into an event-entity index without building a global knowledge graph. SAG represents each chunk as a semantically complete event paired with its entities, forming a latent hyperedge that preserves n-ary relations without decomposing them into triples. At query time, SAG treats shared entities as join keys to connect related chunks. This dynamically yields a query-scoped neighborhood of events, and yet every piece of evidence remains the original chunk throughout. Experiments on HotpotQA, 2WikiMultiHopQA, and MuSiQue show that SAG achieves the best retrieval and end-to-end QA performance on every benchmark, with gains that widen as reasoning-chain complexity increases. On MuSiQue, where multi-hop evidence chaining is most demanding, SAG reaches 80.36% Recall@5, outperforming the strongest baseline by 11.52 points. This work paves the way for knowledge infrastructure that enables LLM agents to retrieve and reason over continually growing organizational knowledge.

知识检索多跳推理RAG

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。