G-CORE: A Core for Future Graph Query Languages
Databases
2017-12-07 v2
Abstract
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.
Cite
@article{arxiv.1712.01550,
title = {G-CORE: A Core for Future Graph Query Languages},
author = {Renzo Angles and Marcelo Arenas and Pablo Barceló and Peter Boncz and George H. L. Fletcher and Claudio Gutierrez and Tobias Lindaaker and Marcus Paradies and Stefan Plantikow and Juan Sequeda and Oskar van Rest and Hannes Voigt},
journal= {arXiv preprint arXiv:1712.01550},
year = {2017}
}