Graph Transformations for the Resource Description Framework

An Algebraic Graph Transformation Approach for RDF and SPARQL

“…Among related works, a category of RDF graphs as well as their transformations have been proposed in [5]. The authors defined objects of RDF graph categories of the form (G Blank , G Triple ) where G Blank and G Triple denote respectively the set of blank nodes and the set of triples of graph G. In addition, the morphisms of such RDF graphs associate blank nodes to blank nodes.…”

“…These definitions of object and morphisms are different from ours. Associating a blank node to any element of a triple, as our homomorphisms do, is called instantiation in [5]. The authors did not tackle the problem of answering SPARQL queries but rather proposed an algebraic approach to transform RDF graphs.…”

“…All parts which are not matched are deleted. Classical graph transformation techniques such as Double Pushout [8] and Single Pushout [9] or even more RDF oriented transformations like MPOC-PO [5] are not best recommended in this case (cf. Section 6 for a comparison with related work).…”

Type Annotation for Adaptive Systems

“…The notion of annotation and its application to typing offers possibilities for the extension of graph transformation approaches to the Semantic Web, exploiting explicit relations between instances and concepts, analogous to the formalisation of RDF proposed in [5].…”