|
|
|
|
|
by slver
1817 days ago
|
|
SQL is neither a graph or hypergraph query language, because relations don't define the graph (or hypergraph). The query does. Deriving a graph and querying a graph are two different things. A graph query language implies you're querying a graph with specific edges, not ones constructed on the fly from the query. GraphQL's goal isn't to be "advanced" either. Its goal is to allow access to any data structure (be it backed by graph, RDBMS, file system, NoSQL, etc. etc.) without burdening said structure with capabilities that are not characteristic to it. Like, if you query a graph, the idea the query may provide any arbitrary join expression would completely drive that graph's performance into the ground. |
|
And not automatically joining by foreign key is a mistake that's going to haunt us for a while I bet.
However when we're arguing capability then it's just as capable of querying a graph as graphDB is. More if the version of SQL supports recursive joins.