Evaluating and benchmarking SPARQL query containment solvers

Melisachew Wudage Chekol 1 Jérôme Euzenat 2 Pierre Genevès 3 Nabil Layaïda 3
1 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
2 EXMO - Computer mediated exchange of structured knowledge
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
3 TYREX - Types and Reasoning for the Web
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : Query containment is the problem of deciding if the answers to a query are included in those of another query for any queried database. This problem is very important for query optimization purposes. In the SPARQL context, it can be equally useful. This problem has recently been investigated theoretically and some query containment solvers are available. Yet, there were no benchmarks to compare theses systems and foster their improvement. In order to experimentally assess implementation strengths and limitations, we provide a first SPARQL containment test benchmark. It has been designed with respect to both the capabilities of existing solvers and the study of typical queries. Some solvers support optional constructs and cycles, while other solvers support projection, union of conjunctive queries and RDF Schemas. No solver currently supports all these features or OWL entailment regimes. The study of query demographics on DBPedia logs shows that the vast majority of queries are acyclic and a significant part of them uses UNION or projection. We thus test available solvers on their domain of applicability on three different benchmark suites. These experiments show that (i) tested solutions are overall functionally correct, (ii) in spite of its complexity, SPARQL query containment is practicable for acyclic queries, (iii) state-of-the-art solvers are at an early stage both in term
Type de document :
Communication dans un congrès
Harith Alani and Lalana Kagal and Achile Fokoue and Paul Groth and Chris Biemann and Parreira, Josiane Xavier and Lora Aroyo and Natalya Noy and Christopher Welty and Krzysztof Janowicz. Proc. 12th International semantic web conference (ISWC), Oct 2013, Sydney, Australia. Springer Verlag, 8219, pp.408-423, 2013, Lecture notes in computer science; The semantic web. <10.1007/978-3-642-41338-4_26>
Liste complète des métadonnées


https://hal.inria.fr/hal-00917911
Contributeur : Jérôme Euzenat <>
Soumis le : jeudi 12 décembre 2013 - 16:17:27
Dernière modification le : jeudi 22 septembre 2016 - 14:33:26
Document(s) archivé(s) le : vendredi 14 mars 2014 - 11:26:22

Fichier

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

Identifiants

Citation

Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda. Evaluating and benchmarking SPARQL query containment solvers. Harith Alani and Lalana Kagal and Achile Fokoue and Paul Groth and Chris Biemann and Parreira, Josiane Xavier and Lora Aroyo and Natalya Noy and Christopher Welty and Krzysztof Janowicz. Proc. 12th International semantic web conference (ISWC), Oct 2013, Sydney, Australia. Springer Verlag, 8219, pp.408-423, 2013, Lecture notes in computer science; The semantic web. <10.1007/978-3-642-41338-4_26>. <hal-00917911>

Partager

Métriques

Consultations de
la notice

436

Téléchargements du document

218