RDF with regular expressions

RDF is a knowledge representation language dedicated to the annotation of resources within the framework of the semantic web. Among the query languages for querying an RDF knowledge base, some, such as SPARQL, are based on the formal semantics of RDF and the concept of consequence semantic, others, inspired by the work in data bases, uses regular expressions making it possible to search the paths in the graph associated with the knowledge base. In order to combine the expressivity of these two approaches, we define a mixed language, called PRDF (for "Paths RDF") in which the arcs of a graph can be labeled by regular expressions. We define the syntax and the semantics of these objects, and propose a correct and complete algorithm which, by a kind of homomorphism, calculates the semantic consequence between an RDF graph and a PRDF graph. This algorithm is the coeur of the extension of the SPARQL query language which we propose and implemented: a PSPARQL query allows to query an RDF knowledge base using graph patterns whose predicates are regular expressions.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  Alfred V. Aho,et al.  Pattern Matching in Strings , 1980 .

[3]  Robert E. Tarjan,et al.  Fast Algorithms for Solving Path Problems , 1981, JACM.

[4]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[5]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[6]  Alberto O. Mendelzon,et al.  A graphical query language supporting recursion , 1987, SIGMOD '87.

[7]  José L. Balcázar,et al.  Structural complexity 1 , 1988 .

[8]  Alberto O. Mendelzon,et al.  G+: Recursive Queries Without Recursion , 1988, Expert Database Conf..

[9]  Mihalis Yannakakis,et al.  Graph-theoretic methods in database theory , 1990, PODS.

[10]  Alberto O. Mendelzon,et al.  GraphLog: a visual formalism for real life recursion , 1990, PODS '90.

[11]  M. Chein,et al.  Conceptual graphs: fundamental notions , 1992 .

[12]  Marie-Laure Mugnier,et al.  Polynomial Algorithms for Projection and Matching , 1992, Workshop on Conceptual Graphs.

[13]  Alberto O. Mendelzon,et al.  Finding Regular Simple Paths in Graph Databases , 1989, SIAM J. Comput..

[14]  Dan Suciu,et al.  A query language and optimization techniques for unstructured data , 1996, SIGMOD '96.

[15]  Jennifer Widom,et al.  The Lorel query language for semistructured data , 1997, International Journal on Digital Libraries.

[16]  Olivier Corby,et al.  A Conceptual Graph Model for W3C Resource Description Framework , 2000, ICCS.

[17]  Maarten de Rijke,et al.  A Modal Perspective on Path Constraints , 2003, J. Log. Comput..

[18]  Jean-François Baget,et al.  Simple Conceptual Graphs Revisited: Hypergraphs and Conjunctive Types for Efficient Projection Algorithms , 2003 .

[19]  Eric Van Wyk,et al.  Universal Regular Path Queries , 2003, High. Order Symb. Comput..

[20]  Yanhong A. Liu,et al.  Parametric regular path queries , 2004, PLDI '04.

[21]  Alberto O. Mendelzon,et al.  Foundations of semantic web databases , 2004, PODS.

[22]  Raphael Volz,et al.  A Comparison of RDF Query Languages , 2004, SEMWEB.

[23]  Jean-François Baget,et al.  Homomorphismes d'hypergraphes pour la subsomption en RDF/RDFS , 2003, Obj. Logiciel Base données Réseaux.

[24]  Herman J. ter Horst,et al.  Extending the RDFS Entailment Lemma , 2004, SEMWEB.

[25]  Dan Brickley,et al.  Rdf vocabulary description language 1.0 : Rdf schema , 2004 .

[26]  Martín Abadi,et al.  Security analysis of cryptographically controlled access to XML documents , 2005, PODS '05.

[27]  Herman J. ter Horst,et al.  Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary , 2005, J. Web Semant..

[28]  Jean-François Baget,et al.  RDF Entailment as a Graph Homomorphism , 2005, SEMWEB.

[29]  Axel Polleres,et al.  From SPARQL to rules (and back) , 2007, WWW '07.