Considering the following graph query operations extracted from [1]

graph pattern matching

basic graph pattern (BGP)

complex graph patterns (CGP)

graph navigation

path query (RPQ)

navigational graph patterns (NGP)

[1] Renzo Angles, Marcelo Arenas, Pablo Barceló, Aidan Hogan, Juan Reutter, and Domagoj Vrgoč. 2017. Foundations of Modern Query Languages for Graph Databases. ACM Comput. Surv. 50, 5, Article 68 (September 2018), 40 pages. DOI:https://doi.org/10.1145/3104031

Which graph query languagens support specific graph query operations bellow ?

BGP that retrieves edge properties (keys and values)

CGP with filter on edge property keys and/or values

CGP with join based on edge property values

NGP with paths specifying edge property values

SPARQL on Named Graphs(reification)?

SPARQL* (SPARQL-Star)?

Cypher? GSQL? Gremilin? PGQL? G-Core?

Will GQL, an upcoming ISO language for property graph, support those operations?

More Veronica Santos's questions See All
Similar questions and discussions