
201
Chapter 14
Queries with Regular
Path Expressions
14.1 Overview
In order for our graph rewriting system to manipulate the provenance graph, we
use a graph manipulation language over RDF called SPARQL (Prud’hommeaux
et al. 2006). In addition, we use one of the features of SPARQL, namely regular
expressions, to identify paths of arbitrary length in a provenance graph (Harris and
Seaborne 2010). We formulate our SPARQL queries around regular expression pat-
terns in order to identify both the resources being shared and the LHS and RHS of
the production rules of a policy set. e regular expressions are used to qualify the
edges of a triple pattern ...