Unverified50% confidenceFactExact time
Multi-hop graph traversal refers to starting from a node and hopping continuously along edge relationships multiple times to discover indirect associations, and it is a core query pattern in graph databases.
1
Sources
50%
Confidence
Long-term
Relevance
10/18/2026
First Seen
Sources
Related Entities
Related Claims
Unverified多跳推理指从起始节点出发经过两个或以上关系边到达目标节点的推理过程，在图数据库中通过图遍历算法（如BFS、Dijkstra）或图查询语言（如Cypher、SPARQL）实现78% similarVerifiedGraph databases store entities and relationships in the form of nodes and edges, and natively support multi-hop reasoning.76% similarUnverifiedFor multi-hop queries, recursive SQL requires a self-join against the same large table at every hop, intermediate results balloon exponentially with depth, and it comes with the overhead of temporary tables, sorting, and hash indexes.72% similarUnverified非原生图数据库需通过全局索引查找相邻节点，时间复杂度随图规模增长为O(log n)甚至O(n)70% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1060279API
curl https://kongchang.com/api/v1/knowledge/claims/1060279MCP
get_claim(id=1060279)