3 ms·

I love the idea of a simplified SQL syntax for joins. I have been working with graph databases for years now: these databases had to solve this problem from da

I love the idea of a simplified SQL syntax for joins. I have been working with graph databases for years now: these databases had to solve this problem from day one, because of the focus on relationships between entities. I must point out that Neo4j was the first to propose a syntax that made traversal feel simple and natural again: the Cypher query language. Neo4 and other industry players have spent years working on a new standard query language for graph databases that was released in April this year: GQL. GQL is the first database query language normalized by ISO since SQL, so it’s a big deal. Anyway, if you wanna learn more about GQL, that a look at https://www.gqlstandards.org/ https://www.gqlstandards.org/

aidos 2y ago
I struggled to find the actual language at the link you posted - is there an obvious example somewhere? Given that graphql is often shortened to gql is feel this is going to get confusing!
- kirmerzlikin 2y ago
  This paper [1] explains some basics [1] https://arxiv.org/abs/2112.06217 https://arxiv.org/abs/2112.06217
twic 2y ago
> I must point out that Neo4j was the first to propose a syntax that made traversal feel simple and natural again Was it the first? Does it predate path expressions in Hibernate Query Language / Java Persistence Query Language?
atombender 2y ago
I think InterSystems Caché did it first. Its SQL join syntax lets you do `WHERE employee->manager->manager->name`. I'm not sure it has arbitrary recursion like you can do with graph databases, however.
ghusbands 2y ago
Graph databases aren't particularly relevant to a novel syntax for relational databases. The part of the related standard that is about relational databases (SQL/PGQ) demands that every table hold either edges or vertices, but not both [1], which is very limiting. [1] https://peter.eisentraut.org/blog/2023/04/04/sql-2023-is-finished-here-is-whats-new https://peter.eisentraut.org/blog/2023/04/04/sql-2023-is-fin...

aidos 2y ago

I struggled to find the actual language at the link you posted - is there an obvious example somewhere? Given that graphql is often shortened to gql is feel this is going to get confusing!

kirmerzlikin 2y ago
This paper [1] explains some basics [1] https://arxiv.org/abs/2112.06217 https://arxiv.org/abs/2112.06217

twic 2y ago

> I must point out that Neo4j was the first to propose a syntax that made traversal feel simple and natural again Was it the first? Does it predate path expressions in Hibernate Query Language / Java Persistence Query Language?

atombender 2y ago

I think InterSystems Caché did it first. Its SQL join syntax lets you do `WHERE employee->manager->manager->name`. I'm not sure it has arbitrary recursion like you can do with graph databases, however.

ghusbands 2y ago

Graph databases aren't particularly relevant to a novel syntax for relational databases. The part of the related standard that is about relational databases (SQL/PGQ) demands that every table hold either edges or vertices, but not both [1], which is very limiting. [1] https://peter.eisentraut.org/blog/2023/04/04/sql-2023-is-finished-here-is-whats-new https://peter.eisentraut.org/blog/2023/04/04/sql-2023-is-fin...