An Algebraic Graph Transformation Approach for RDF and SPARQL

Dominique Duval
(CNRS and Univ. Grenoble Alpes, France)
Rachid Echahed
(CNRS and Univ. Grenoble Alpes, France)
Frédéric Prost
(CNRS and Univ. Grenoble Alpes, France)

We consider the recommendations of the World Wide Web Consortium (W3C) about RDF framework and its associated query language SPARQL. We propose a new formal framework based on category theory which provides clear and concise formal definitions of the main basic features of RDF and SPARQL. We define RDF graphs as well as SPARQL basic graph patterns as objects of some nested categories. This allows one to clarify, in particular, the role of blank nodes. Furthermore, we consider basic SPARQL CONSTRUCT and SELECT queries and formalize their operational semantics following a novel algebraic graph transformation approach called POIM.

In Berthold Hoffmann and Mark Minas: Proceedings of the Eleventh International Workshop on Graph Computation Models (GCM 2020), Online-Workshop, 24th June 2020, Electronic Proceedings in Theoretical Computer Science 330, pp. 55–70.
Published: 3rd December 2020.

ArXived at: http://dx.doi.org/10.4204/EPTCS.330.4 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org