G-CORE: A Core for Future Graph Query Languages

12/05/2017
by   Renzo Angles, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/25/2018

Killing Two Birds with One Stone -- Querying Property Graphs using SPARQL via GREMLINATOR

Knowledge graphs have become popular over the past decade and frequently...
research
03/06/2020

Structural Indexing for Conjunctive Path Queries

Structural indexing is an approach to accelerating query evaluation, whe...
research
07/10/2023

The Linked Data Benchmark Council (LDBC): Driving competition and collaboration in the graph data management space

Graph data management is instrumental for several use cases such as reco...
research
10/26/2021

Graph? Yes! Which one? Help!

Amazon Neptune is a graph database service that supports two graph (meta...
research
07/27/2022

Representing Paths in Graph Database Pattern Matching

Modern graph database query languages such as GQL, SQL/PGQ, and their ac...
research
05/30/2020

A Novel Approach for Generating SPARQL Queries from RDF Graphs

This work is done as part of a research master's thesis project. The goa...
research
11/17/2021

Semantic Foundations of Seraph Continuous Graph Query Language

The scientific community has been studying graph data models for decades...

Please sign up or login with your details

Forgot password? Click here to reset