G-CORE

A Core for Future Graph Query Languages

G-CORE is a graph query language for property graph databases.

G-CORE was design by the LDBC Graph Query Language Task Force, consisting of members from industry and academia, intending to bring the best of both worlds to graph practitioners.

The main features of G-CORE are the following:

  • A Property Graph data model which consists of nodes, edges, paths and properties;
  • Paths as first class citizens: paths can be queried and manipulated (as nodes and edges);
  • Core operations: graph patterns (JOF), path patterns (RPQs), aggregation, subqueries (Exists+SetOp), graph and path construction;
  • Composability: operations where the input and the output are graphs;
  • Balance between query expressivity and evaluation complexity.

Documentation

  • G-CORE: A Core for Future Graph Query Languages, SIGMOD'2018 (pdf)
  • G-CORE: A Core for Future Graph Query Languages, Technical Report (arxiv)

G-CORE in Apache Spark

An implementation of G-CORE on top of Apache Spark is in current development. The design team is formed by Marcelo Arenas, Peter Boncz and Renzo Angles.

The source code of the implementation is available in GitHub. A compiled version is available Here (215MB). It contains a java Application (*.jar file) with a basic visual interface. The readme file is available Here .