RDF with regular expressions - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2007

RDF with regular expressions

Résumé

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.
Fichier principal
Vignette du fichier
PSPARQL-JWS-new-version.pdf (391.06 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00144922 , version 1 (07-05-2007)
inria-00144922 , version 2 (21-05-2007)
inria-00144922 , version 3 (22-05-2007)
inria-00144922 , version 4 (22-05-2007)

Identifiants

  • HAL Id : inria-00144922 , version 1

Citer

Faisal Alkhateeb, Jean-François Baget, Jérôme Euzenat. RDF with regular expressions. [Research Report] 2007. ⟨inria-00144922v1⟩
537 Consultations
300 Téléchargements

Partager

Gmail Facebook X LinkedIn More