Constrained regular expressions in SPARQL - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Constrained regular expressions in SPARQL

Résumé

We have proposed an extension of SPARQL, called PSPARQL, to characterize paths of variable lengths in an RDF knowledge base (e.g. "Does there exists a trip from town A to town B?"). However, PSPARQL queries do not allow expressing constraints on internal nodes (e.g. "Moreover, one of the stops must provide a wireless access."). This paper proposes an extension of PSPARQL, called CPSPARQL, that allows expressing constraints on paths. For this extension, we provide an abstract syntax, semantics as well as a sound and complete inference mechanism for answering CPSPARQL queries.
Fichier principal
Vignette du fichier
alkhateeb2008a.pdf (254.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00793531 , version 1 (22-02-2013)

Identifiants

  • HAL Id : hal-00793531 , version 1

Citer

Faisal Alkhateeb, Jean-François Baget, Jérôme Euzenat. Constrained regular expressions in SPARQL. International conference on semantic web and web services - SWWS 2008, Aug 2008, Las Vegas, Nevada, United States. pp.91-99. ⟨hal-00793531⟩
307 Consultations
177 Téléchargements

Partager

Gmail Facebook X LinkedIn More