An Algebraic Graph Transformation Approach for RDF and SPARQL
Databases
2020-12-04 v1 Programming Languages
Symbolic Computation
Abstract
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.
Cite
@article{arxiv.2012.01658,
title = {An Algebraic Graph Transformation Approach for RDF and SPARQL},
author = {Dominique Duval and Rachid Echahed and Frédéric Prost},
journal= {arXiv preprint arXiv:2012.01658},
year = {2020}
}
Comments
In Proceedings GCM 2020, arXiv:2012.01181. arXiv admin note: substantial text overlap with arXiv:1910.07519