The DL-Lite family of Description Logics has been designed with the
specific goal of allowing for answering complex queries (in particular,
conjunctive queries) over ontologies with very large instance sets
(ABoxes). So far, in DL-Lite systems, this goal has been actually
achieved only for relatively simple (short) conjunctive queries.
In this paper we present Presto, a new query answering technique
for DL-Lite ontologies, and an experimental comparison of Presto
with the main previous approaches to query answering in DL-Lite.
In practice, our experiments show that, in real ontologies, current
techniques are only able to answer conjunctive queries of less than
7-10 atoms (depending on the complexity of the TBox), while Presto
is actually able to handle conjunctive queries of up to 30 atoms.
Furthermore, in the cases that are already successfully handled by
previous approaches, Presto is significantly more efficient.
%0 Journal Article
%1 Rosati2010
%A Rosati, Riccardo
%A Almatelli, Alessandro
%D 2010
%K description_logics
%T Improving Query Answering over DL-Lite Ontologies
%U http://www.aaai.org/ocs/index.php/KR/KR2010/paper/view/1400/1630
%X The DL-Lite family of Description Logics has been designed with the
specific goal of allowing for answering complex queries (in particular,
conjunctive queries) over ontologies with very large instance sets
(ABoxes). So far, in DL-Lite systems, this goal has been actually
achieved only for relatively simple (short) conjunctive queries.
In this paper we present Presto, a new query answering technique
for DL-Lite ontologies, and an experimental comparison of Presto
with the main previous approaches to query answering in DL-Lite.
In practice, our experiments show that, in real ontologies, current
techniques are only able to answer conjunctive queries of less than
7-10 atoms (depending on the complexity of the TBox), while Presto
is actually able to handle conjunctive queries of up to 30 atoms.
Furthermore, in the cases that are already successfully handled by
previous approaches, Presto is significantly more efficient.
@article{Rosati2010,
abstract = {The DL-Lite family of Description Logics has been designed with the
specific goal of allowing for answering complex queries (in particular,
conjunctive queries) over ontologies with very large instance sets
(ABoxes). So far, in DL-Lite systems, this goal has been actually
achieved only for relatively simple (short) conjunctive queries.
In this paper we present Presto, a new query answering technique
for DL-Lite ontologies, and an experimental comparison of Presto
with the main previous approaches to query answering in DL-Lite.
In practice, our experiments show that, in real ontologies, current
techniques are only able to answer conjunctive queries of less than
7-10 atoms (depending on the complexity of the TBox), while Presto
is actually able to handle conjunctive queries of up to 30 atoms.
Furthermore, in the cases that are already successfully handled by
previous approaches, Presto is significantly more efficient.},
added-at = {2011-08-09T16:33:51.000+0200},
author = {Rosati, Riccardo and Almatelli, Alessandro},
biburl = {https://www.bibsonomy.org/bibtex/2ab80ec5d64afb8b12f51c0ad292a5873/reynares.e},
conference = {Knowledge Representation and Reasoning Conference},
interhash = {f7b99493d5a768449b5e1847893fc768},
intrahash = {ab80ec5d64afb8b12f51c0ad292a5873},
keywords = {description_logics},
timestamp = {2013-05-16T23:34:11.000+0200},
title = {Improving Query Answering over DL-Lite Ontologies},
url = {http://www.aaai.org/ocs/index.php/KR/KR2010/paper/view/1400/1630},
year = 2010
}