Query Optimization for Ontology-Mediated Query Answering - Archive ouverte HAL Access content directly
Conference Papers Year : 2024

Query Optimization for Ontology-Mediated Query Answering

Abstract

Ontology-mediated query answering (OMQA) consists in asking database queries on knowledge bases (KBs); a KB is a set of facts called the KB's database, which is described by domain knowledge called the KB's ontology. A widely-investigated OMQA technique is FO-rewriting: every query asked on a KB is reformulated w.r.t. the KB's ontology, so that its answers are computed by the relational evaluation of the query reformulation on the KB's database. Crucially, because FO-rewriting compiles the domain knowledge relevant to queries into their reformulations, query reformulations may be complex and their optimization is the crux of efficiency. We devise a novel optimization framework for a large set of OMQA settings that enjoy FO-rewriting: conjunctive queries, i.e., the core select-project-join queries, asked on KBs expressed using datalog±, description logics, existential rules, OWL, or RDFS. We optimize the query reformulations produced by state-of-the-art FO-rewriting algorithms by computing rapidly, with the help of a KB's database summary, simpler (contained) queries with the same answers that can be evaluated faster by RDBMSs. We show on a well-established OMQA benchmark that time performance is significantly improved by our optimization framework in general, up to three orders of magnitude.
Fichier principal
Vignette du fichier
main.pdf (871.79 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : Public Domain

Dates and versions

hal-04470002 , version 1 (21-02-2024)

Identifiers

Cite

Wafaa El Husseini, Cheikh Brahim El Vaigh, François Goasdoué, Hélène Jaudoin. Query Optimization for Ontology-Mediated Query Answering. The ACM Web Conference (WWW), May 2024, Singapore, Singapore. ⟨10.1145/3589334.3645567⟩. ⟨hal-04470002⟩
62 View
47 Download

Altmetric

Share

Gmail Facebook X LinkedIn More