arXiv Computation and Language

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

arXiv Computation and Language
Aug 27

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

SAG (SQL‑Retrieval Augmented Generation) is a structured retrieval framework that indexes documents as event‑entity pairs, forming latent hyperedges that preserve n‑ary relations without building a global knowledge graph. At query time, shared entities act as join keys, dynamically creating a query‑scoped neighborhood of related events while keeping each evidence chunk intact. Experiments on HotpotQA, 2WikiMultiHopQA, and MuSiQue demonstrate that SAG outperforms existing dense‑retrieval baselines, achieving the highest recall and end‑to‑end QA performance, especially as reasoning‑chain complexity grows.

By Yuchao Wu, Junqin Li, Xingcheng Liang, Yongjie Chen, Yinghao Liang, Linyuan Mo, Guanxian Li
arXiv Computation and Language
Oct 19

SAG2: Embedding-Free Multi-Hop Retrieval with BM25 and JEV

SAG2 is an embedding‑free multi‑hop retrieval system that relies on a single SQLite database, BM25, and contextual evidence decisions from JEV. It replaces dense indexes with a lexical index over original passages, allowing query‑time evidence selection without offline embedding computation or dedicated database servers. On several benchmark datasets, SAG2 achieves the highest Recall@5 and Recall@10, demonstrating strong retrieval accuracy with lightweight preparation and rapid indexing.

By Yuchao Wu
arXiv AI
3d ago

ArcRAG: Agentic Compositional Retrieval over Knowledge Graphs

ArcRAG is a retrieval-augmented generation system that operates over knowledge graphs without relying on construction‑specific schemas or relation names. It dynamically induces a query‑local graph interface at inference time, plans multi‑hop traversals, and executes them as Cypher queries. Experiments on MuSiQue, HotpotQA, and TriviaQA show that ArcRAG remains effective across both schema‑guided and open‑information‑extraction graph constructions, demonstrating that retrieval can be construction‑agnostic.

By Jyotin Goel, Abhinav Arun, Tejas Prakash Agarwal, Bhaskarjit Sarmah, Stefano Pasquali
arXiv AI
Jun 9

UnWeaving the knots of GraphRAG -- turns out VectorRAG is almost enough

arXiv:2603. 29875v3 Announce Type: replace-cross Abstract: One of the key problems in Retrieval-augmented generation (RAG) systems is that chunk-based retrieval pipelines represent the source chunks as atomic objects, mixing the information contained within such a chunk into a single vector.

By Ryszard Tuora, Mateusz Gali\'nski, Micha{\l} Godziszewski, Micha{\l} Karpowicz, Mateusz Czy\.znikiewicz, Adam Kozakiewicz, Tomasz Zi\k{e}tkiewicz
arXiv AI
Jun 17

A Unified Framework for Context-Aware and Relation-Aware Graph Retrieval-Augmented Generation

arXiv:2606. 18075v1 Announce Type: new Abstract: Retrieval-Augmented Generation (RAG) has emerged as a paradigm for enhancing large language models (LLMs) with external knowledge, yet existing graph-based methods face a fundamental limitation: entity-centric and chunk-centric approaches operate on representations anchored to original text without true knowledge fusion.

By Haoyang Zhong, Yifei Sun, Antong Zhang, Chunping Wang, Lei Chen, Yang Yang
arXiv Computation and Language
Sep 1

Hi-Q: Hierarchical Evidence-guided Query Refinement for Multi-Hop Question Answering

Hi-Q is a new framework for multi‑hop question answering that refines queries hierarchically based on evidence retrieved from a corpus. At each node it tests whether the current query unit is supported by evidence; if not, the node is expanded using a dependency‑preserving binary operator and verified for semantic coverage. The resulting query tree grows according to corpus support signals, and Hi‑Q achieves state‑of‑the‑art performance on three multi‑hop QA benchmarks, outperforming both iterative retrieval and graph‑based baselines without constructing a corpus‑wide graph.

By Jueun Kim, Sungho Park, Wook-Shin Han