[dathinab]

if you are Facebook scale, yes. But then you anyway will use a dedicated graph database.

But a lot of graph databases have sizes where they are fully replicated on each node and some small internal optimizations for the graph are good enough. Given the design of the graph query language (and what you can query, hint: not everything arbitrarily) there is no reason postgres can't gain some additional optimizations to do that effectively as long as it's not facebook scale.

SQL now having syntax for querying graph means Graph databases can support SQL, at least a subset of it, in a standardized way.