Optimizing FOL reducible query answering: understanding performance challenges

Abstract : Semantic Web data management raises the challenge of answering queries under constraints (i.e., in the presence of implicit data). To bridge the gap between this extended setting and that of query evaluation provided by database engines, a reasoning step (w.r.t. the constraints) is necessary before query evaluation. A large and useful set of ontology languages enjoys FOL reducibility of query answering: queries can be answered by evaluating a SQLized first-order logic (FOL) formula (obtained from the query and the ontology) directly against the explicitly stored data (i.e., without considering the ontological constraints). Our demonstration showcases to the attendees, and analyzes, the performance of several reformulation-based query answering techniques, including one we recently described in [5], applied to the lightweight description logic DL-LiteR underpinning the W3C's OWL2 QL profile.
Type de document :
Communication dans un congrès
ISWC 2016: The 15th International Semantic Web Conference, Oct 2016, Kobe, Japan. 2016, <http://iswc2016.semanticweb.org/>
Liste complète des métadonnées


https://hal.inria.fr/hal-01400568
Contributeur : Damian Bursztyn <>
Soumis le : mardi 22 novembre 2016 - 10:46:15
Dernière modification le : mercredi 12 juillet 2017 - 01:14:24
Document(s) archivé(s) le : mardi 21 mars 2017 - 07:05:09

Fichier

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

Identifiants

  • HAL Id : hal-01400568, version 1

Citation

Damian Bursztyn, François Goasdoué, Ioana Manolescu. Optimizing FOL reducible query answering: understanding performance challenges. ISWC 2016: The 15th International Semantic Web Conference, Oct 2016, Kobe, Japan. 2016, <http://iswc2016.semanticweb.org/>. <hal-01400568>

Partager

Métriques

Consultations de
la notice

365

Téléchargements du document

44