GQL (graph query language) is a standard in-the-works for issuing queries over property graphs. The GPML (graph pattern matching sublanguage) is what specifies how path, edge, and vertex patterns should be written. While Graphix inherits the base language for query patterns from Cypher, even Neo4J is trying to move towards the GQL's GPML standard.
The interesting bits for Graphix is the increase in expressiveness (users now express recursion over patterns, not edges like in Graphix) as well as the explicit specification of pattern matching requirements. The latter is something that looks attractive for us, giving us the control to specify the pattern and navigation semantics for each connected pattern. Currently, Graphix enforces a single semantics for pattern matching and navigation across the entire query.
For more information, we refer to here: https://dl.acm.org/doi/10.1145/3514221.3526057
GQL (graph query language) is a standard in-the-works for issuing queries over property graphs. The GPML (graph pattern matching sublanguage) is what specifies how path, edge, and vertex patterns should be written. While Graphix inherits the base language for query patterns from Cypher, even Neo4J is trying to move towards the GQL's GPML standard.
The interesting bits for Graphix is the increase in expressiveness (users now express recursion over patterns, not edges like in Graphix) as well as the explicit specification of pattern matching requirements. The latter is something that looks attractive for us, giving us the control to specify the pattern and navigation semantics for each connected pattern. Currently, Graphix enforces a single semantics for pattern matching and navigation across the entire query.
For more information, we refer to here: https://dl.acm.org/doi/10.1145/3514221.3526057