G-CORE: A Core for Future Graph Query Languages

2017/12/05 by Renzo Angles, Angles, Renzo, Marcelo Arenas +21 · 3 citations
Computer Science · #Advanced Database Systems and Queries #Databases (cs.DB) #FOS: Computer and information sciences #Graph Theory and Algorithms #Semantic Web and Ontologies

paper · pdf · doi:10.48550/arxiv.1712.01550

openalex publication_date 2017/12/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• A Logical View of GNN-Style Computation and the Role of Activation Functions
• Sequent Calculi for Data-Aware Modal Logics
• On the Expressiveness of Languages for Querying Property Graphs in Relational Databases

Related

• Introducing PathQuery, Google's Graph Query Language
• Foundations of Modern Query Languages for Graph Databases
• Path-based Algebraic Foundations of Graph Query Languages
• Graph Pattern Matching in GQL and SQL/PGQ
• Querying in the Age of Graph Databases and Knowledge Graphs