A Benchmark for Semantic Web Query Containment, Equivalence and Satisfiability

Melisachew Wudage Chekol 1 Jérôme Euzenat 1 Pierre Genevès 2 Nabil Layaïda 2
1 EXMO - Computer mediated exchange of structured knowledge
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
2 WAM - Web, adaptation and multimedia
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : The problem of SPARQL query containment has recently attracted a lot of attention due to its fundamental purpose in query optimization and information integration. New approaches to this problem, have been put forth, that can be implemented in practice. However, these approaches suffer from various limitations: coverage (size and type of queries), response time (how long it takes to determine containment), and the technique applied to encode the problem. In order to experimentally assess implementation limitations, we designed a benchmark suite offering different experimental settings depending on the type of queries, projection and reasoning (RDFS). We have applied this benchmark to three available systems using different techniques highlighting the strengths and weaknesses of such systems.
Document type :
Reports
[Research Report] RR-8128, INRIA. 2012, pp.10


https://hal.inria.fr/hal-00749286
Contributor : Vincent Quint <>
Submitted on : Monday, November 12, 2012 - 12:35:51 PM
Last modification on : Tuesday, November 13, 2012 - 10:15:22 AM

File

RR-8128.pdf
fileSource_public_author

Identifiers

  • HAL Id : hal-00749286, version 2

Collections

Citation

Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda. A Benchmark for Semantic Web Query Containment, Equivalence and Satisfiability. [Research Report] RR-8128, INRIA. 2012, pp.10. <hal-00749286v2>

Export

Share

Metrics

Consultation de
la notice

233

Téléchargement du document

93