G-CORE: A Core for Future Graph Query Languages
Renzo Angles, Marcelo Arenas, Pablo Barcel\'o, Peter Boncz, and George H. L. Fletcher, Claudio Gutierrez, Tobias Lindaaker and, Marcus Paradies, Stefan Plantikow, Juan Sequeda, Oskar van Rest and, Hannes Voigt
TL;DR
G-CORE is a proposed graph query language designed for future systems, emphasizing composability and first-class path support, balancing expressivity with evaluation complexity.
Contribution
It introduces G-CORE, a novel graph query language that supports composability and first-class paths, addressing limitations of existing systems.
Findings
G-CORE supports composable graph queries with paths as first-class citizens.
It balances path query expressivity with manageable evaluation complexity.
The language is the result of a collaborative effort between industry and academia.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Semantic Web and Ontologies · Graph Theory and Algorithms