G-CORE
Renzo Angles, Marcelo Arenas, Pablo Barceló et al. · Proceedings - ACM-SIGMOD International Conference on Management of Data · 2018
We report on a community effort between industry and academia to shape the future of graph query languages. We argue that existing graph database management systems should consider supporting a query language with two key characteristics. First, it should be composable, meaning, that graphs are the input and the output of queries. Second, the graph query language should treat paths as first-class citizens. Our result is G-CORE, a powerful graph query language design that fulfills these goals, and strikes a careful balance between path query expressivity and evaluation complexity.
Cited by 148 works. doi:10.1145/3183713.3190654 Open-access PDF
Authors
- Renzo Angles
- Marcelo Arenas
- Pablo Barceló
- Peter A. Boncz
- George Fletcher
- Claudio Gutiérrez
- Tobias Lindaaker
- Marcus Paradies
- Stefan Plantikow
- Juan Sequeda
- Oskar van Rest
- Hannes Voigt
References
- The complexity of relational query languages (Extended Abstract)
- Survey of graph database models
- Finding Regular Simple Paths in Graph Databases
- Semantics and complexity of SPARQL
- Cypher
- A Comparison of Current Graph Database Models
- Foundations of Modern Query Languages for Graph Databases
- The LDBC Social Network Benchmark
- Query languages for graph databases
- Constructions from dots and lines