> The solution is to build and index denormalized n-th order relationship tables. Can you elaborate on this? Does an n-th order relationship table contain all

> The solution is to build and index denormalized n-th order relationship tables. Can you elaborate on this? Does an n-th order relationship table contain all the nodes reachable from some node going through n edges? And you'd have one such table for each integer in the range 2..n?