DeepAI AI Chat
Log In Sign Up

A Rule-based Operational Semantics of Graph Query Languages

by   Dominique Duval, et al.
Université Grenoble Alpes

We consider a core language of graph queries. These queries are seen as formulas to be solved with respect to graph-oriented databases. For this purpose, we first define a graph query algebra where some operations over graphs and sets of graph homomorphisms are specified. Then, the notion of pattern is introduced to represent a kind of recursively defined formula over graphs. The syntax and formal semantics of patterns are provided. Afterwards, we propose a new sound and complete calculus to solve patterns. This calculus, which is based on a rewriting system, develops only one derivation per pattern to be solved. Our calculus is generic in the sense that it can be adapted to different kinds of graph databases provided that the notions of graph and graph homomorphism (match) are well defined.


page 1

page 2

page 3

page 4


Querying RDF Databases with Sub-CONSTRUCTs

Graph query languages feature mainly two kinds of queries when applied t...

GPC: A Pattern Calculus for Property Graphs

The development of practical query languages for graph databases runs we...

Relational Diagrams: a pattern-preserving diagrammatic representation of non-disjunctive Relational Queries

Analyzing relational languages by their logical expressiveness is well u...

On foundational aspects of RDF and SPARQL

We consider the recommendations of the World Wide Web Consortium (W3C) a...

An Algebraic Graph Transformation Approach for RDF and SPARQL

We consider the recommendations of the World Wide Web Consortium (W3C) a...

Formal Semantics of the Language Cypher

Cypher is a query language for property graphs. It was originally design...

Introducing PathQuery, Google's Graph Query Language

We introduce PathQuery, a graph query language developed to scale with G...