Constrained regular expressions for answering RDF-path queries modulo RDFS

Faisal Alkhateeb 1 Jérôme Euzenat 2
2 EXMO - Computer mediated exchange of structured knowledge
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : The standard SPARQL query language is currently defined for querying RDF graphs without RDFS semantics. Several extensions of SPARQL to RDFS semantics have been proposed. In this paper, we discuss extensions of SPARQL that use regular expressions to navigate RDF graphs and may be used to answer queries considering RDFS semantics. In particular, we present and compare nSPARQL and our proposal CPSPARQL. We show that CPSPARQL is expressive enough to answer full SPARQL queries modulo RDFS. Finally, we compare the expressiveness and complexity of both nSPARQL and the corresponding frag- ment of CPSPARQL, that we call cpSPARQL. We show that both languages have the same complexity through cpSPARQL, being a proper extension of SPARQL graph patterns, is more expressive than nSPARQL.
Type de document :
Article dans une revue
International Journal of web information systems, Emerald, 2014, 10 (1), pp.24-50. 〈10.1108/IJWIS-05-2013-0013〉
Liste complète des métadonnées

Littérature citée [33 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00975283
Contributeur : Jérôme Euzenat <>
Soumis le : mardi 8 avril 2014 - 12:43:05
Dernière modification le : jeudi 11 octobre 2018 - 08:48:02
Document(s) archivé(s) le : mardi 8 juillet 2014 - 11:45:53

Fichier

alkhateeb2014a.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Faisal Alkhateeb, Jérôme Euzenat. Constrained regular expressions for answering RDF-path queries modulo RDFS. International Journal of web information systems, Emerald, 2014, 10 (1), pp.24-50. 〈10.1108/IJWIS-05-2013-0013〉. 〈hal-00975283〉

Partager

Métriques

Consultations de la notice

985

Téléchargements de fichiers

308