G-CORE a core for future graph query languages

Renzo Angles, Marcelo Arenas, Pablo Barceló, Peter Boncz, George Fletcher, Claudio Gutierrez, Tobias Lindaaker, Marcus Paradies, Stefan Plantikow, Juan Sequeda, Oskar van Rest, Hannes Voigt

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

100 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationSIGMOD 2018 - Proceedings of the 2018 International Conference on Management of Data
EditorsGautam Das, Christopher Jermaine, Ahmed Eldawy, Philip Bernstein
Place of PublicationNew York
PublisherAssociation for Computing Machinery, Inc
Number of pages12
ISBN (Electronic)978-1-4503-4703-7
Publication statusPublished - 27 May 2018
Event44th ACM SIGMOD International Conference on Management of Data, SIGMOD 2018 - Houston, United States
Duration: 10 Jun 201815 Jun 2018


Conference44th ACM SIGMOD International Conference on Management of Data, SIGMOD 2018
Country/TerritoryUnited States


  • Graph data models
  • Graph databases
  • Graph query languages
  • graph data models
  • graph query languages


Dive into the research topics of 'G-CORE a core for future graph query languages'. Together they form a unique fingerprint.

Cite this