检索说明

  • 查询:GraphRAG evidence retrieval
  • 年份过滤:2025-
  • 单查询上限:20
  • 发现日期:2026-11-12

Semantic Scholar 候选元数据

  • 作者:Bastian Lipka, Venkata Vamsikrishna Meduri, B. Reinwald, Nasrullah Sheikh
  • 年份:2026
  • Venue:IEEE International Conference on Data Engineering
  • DOI:10.1109/ICDE65706.2026.00317
  • arXiv:未返回
  • S2 citationCount(当前快照):0
  • 来源线索:https://doi.org/10.1109/ICDE65706.2026.00317

摘要(未核验)

Large-language-model-powered systems are increasingly used over heterogeneous enterprise data, but hybrid search (lexical + dense) alone cannot enforce structured filters and multi-hop predicates when schemas are complex. In practice, many user predicates refer to relationships—keys, joins, and paths—that must be followed to constrain results. We address this by executing graph-traversal on top of hybrid search. We develop Schema-GraphRAG, a retrieval-only backend that couples hybrid text search with schema-aware traversal. Each row is serialized to JSON for BM25 and vector indexing. Primary-foreign-key links form an instance graph with a schema overlay. Queries accept lexical terms, a dense text query, and optional Gremlin traversals that express filter predicates and path constraints. The engine first runs hybrid search to produce seed entities, then applies the traversal to enforce filters, expand along permissible paths, and assemble evidence; results are returned as {id, json} with provenance. We demonstrate the system on a retail slice through four scenarios—hybrid only, deterministic path expansion, flexible end-type traversal, and a live insert that updates results immediately.

转为正式文献前的核验清单

  • [ ] 从论文、出版社、会议、ACL Anthology、OpenReview 或 arXiv 页面核对标题、作者、年份和版本。
  • [ ] 核对 DOI、venue、正式链接和是否存在撤稿/版本变化。
  • [ ] 阅读正文后补充方法、证据边界、结果和与现有研究的关系。

Semantic Scholar 记录用于发现候选,不是正式一手引文,也不支持对结果覆盖范围或研究质量的穷尽性判断。