Sure, at its most basic a graph database is just a bunch of many2many relationships.
The recursive query is cool, but how is the performance for graph queries compared to a DB optimized for this use case ?
The recursive query is cool, but how is the performance for graph queries compared to a DB optimized for this use case ?
But I think Postgres is likely to get these improvements in a few years too.