Unverified50% confidenceTradeoffExact time
传统向量检索只能基于语义相似度找到最像的文档片段，无法执行A作用于B、B关联C、C导致D这类链式多跳推理，而知识图谱可通过图遍历算法或图查询语言实现多跳推理
1
Sources
50%
Confidence
Long-term
Relevance
8/28/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedVector retrieval relies on vector databases for fuzzy matching and cannot precisely express structural relationships, whereas graph retrieval uses graph databases as the storage medium and is specifically optimized for multi-hop traversal queries.75% 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.73% similarVerified关键词搜索基于精确字符匹配无法理解同义词，语义搜索依赖向量嵌入可捕捉语义关联，两者结合的混合检索效果优于单一方法73% similarUnverified相似度检索通常取Top-K（如Top-3或Top-5）最相似的文本块，相似度计算常用余弦相似度或内积69% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/810954API
curl https://kongchang.com/api/v1/knowledge/claims/810954MCP
get_claim(id=810954)