Traversals and Paths
0 questions
Variable-length patterns, shortest-path functions, and depth limits — the queries graph databases exist for in the first place. Expect to be asked what an unbounded traversal costs, and how you stop a friends-of-friends query from walking the entire graph.
questions
no questions here yet
this part of the tree is still being written
>
0 questions in this topic or below it