Conception d'un famework pour la relaxation des requêtes SPARQL

Abstract : Ontology (or Knowledge base) is a formal representation of knowledge as entities and facts related to these entities. In the past years, several ontologies have been developed in academic and industrial contexts.They are generally defined with RDF language and querying with SPARQL language. A partial knowledge of instances and schema of ontology may lead user to execute queries that result in empty answers, considered as unsatisfactory. Among cooperative querying techniques which have been developed to solve the problem of empty answers, query relaxation technique is the well-known and used. It aims at weakening the conditions expressed in the original query to return alternative answers to the user. Existing work on relaxation of SPARQL queries we suffer from many drawbacks : (1) they do not allow defining in precise way the relaxation to perform with the ability to control the relaxation process (2) they do not identify the causes of failure of the request expressed by the user and (3) they do not include interactive tools to better exploit the relaxation techniques proposed. To address these limitations, this thesis proposes an advanced framework forquery relaxation SPARQL. First, this framework includes a set of relaxation operators dedicated to SPARQLqueries, to incrementally relax specific parts of the user request while controlling the relevance of the alternative responses returned w.r.t. to the user needs expressed in his request. Our framework also provides both several algorithms that identify the causes of failure of the user query and queries that are successful with a maximum number of conditions initially expressed in the failing request. This information allows the user to better understand why his request fails and execute queries that return non-empty alternative results. Finally,our framework offers intelligent relaxation strategies that rely on the causes of query failure. Such strategies reduce the execution time of the relaxation process compared to the traditional approach, which executes relaxed requests, based on their similarity to the user request, until a number of satisfactory alternative results is obtained. All contributions proposed in this framework were implemented and validated by experiments and scenarios based on the tests bench LUBM. They show the interest of our contributions w.r.t. the state of theart.
Document type :
Theses
Complete list of metadatas

Cited literature [253 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01430177
Contributor : Abes Star <>
Submitted on : Monday, January 9, 2017 - 3:36:05 PM
Last modification on : Thursday, May 17, 2018 - 4:00:27 AM
Long-term archiving on : Monday, April 10, 2017 - 3:27:26 PM

File

2016ESMA0014_fokou_pelap.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01430177, version 1

Collections

STAR | CEA

Citation

Géraud Fokou Pelap. Conception d'un famework pour la relaxation des requêtes SPARQL. Autre [cs.OH]. ISAE-ENSMA Ecole Nationale Supérieure de Mécanique et d'Aérotechique - Poitiers, 2016. Français. ⟨NNT : 2016ESMA0014⟩. ⟨tel-01430177⟩

Share

Metrics

Record views

323

Files downloads

804