Unverified50% confidenceSolutionExact time
GraphRAG local queries execute k-hop graph traversal (typically k=1 or 2) to collect path information; global queries adopt a Map-Reduce strategy to generate answers based on community summaries.
1
Sources
50%
Confidence
Long-term
Relevance
9/10/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedGraphRAG Blueprint offers two retrieval modes—local mode and global mode—where local mode targets precise factual question answering and global mode is oriented toward cross-document synthesis and summarization.66% similarUnverifiedThe graph structure of a knowledge graph natively supports graph traversal algorithms, allowing queries such as 'find all places that call function A' to complete in milliseconds.64% similarUnverifiedGraphRAG Blueprint adopts a domain-agnostic LLM prompt design, allowing users to migrate to different vertical domains by replacing prompt templates via the PROMPTS_PATH parameter.63% similarUnverified多跳推理指从起始节点出发经过两个或以上关系边到达目标节点的推理过程，在图数据库中通过图遍历算法（如BFS、Dijkstra）或图查询语言（如Cypher、SPARQL）实现61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/887385API
curl https://kongchang.com/api/v1/knowledge/claims/887385MCP
get_claim(id=887385)