> Joins are not even a thing in graph databases; being able to directly query across edges obviates the entire concept. Joins are the central thing in graph da

> Joins are not even a thing in graph databases; being able to directly query across edges obviates the entire concept. Joins are the central thing in graph databases, even if you don't think of it in those terms or materialize some of the join operations. Being able to directly query across edges is a logical operation, it doesn't imply the underlying implementation. While the simple "node/edge" model in memory seems easy, it also has pathologically poor locality so most graph databases use less direct representations (traversed with join operations under the hood) with much higher average performance.