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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

Contributor : Damian Bursztyn <>
Submitted on : Tuesday, November 22, 2016 - 10:46:15 AM
Last modification on : Thursday, June 13, 2019 - 11:34:02 AM
Long-term archiving on : Tuesday, March 21, 2017 - 7:05:09 AM


Files produced by the author(s)


  • HAL Id : hal-01400568, version 1


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. ⟨hal-01400568⟩



Record views


Files downloads