Query Extensions and Incremental Query Rewriting for OWL 2 QL Ontologies
Query Extensions and Incremental Query Rewriting for OWL 2 QL Ontologies
复制标题
DOI：
10.1007/s13740-012-0017-6
复制
发表时间：
2014-03
影响因子：
--
通讯作者：
Tassos Venetis;G. Stoilos;G. Stamou
中科院分区：
文献类型：
--
作者：
Tassos Venetis;G. Stoilos;G. Stamou
查询重写轻量级本体，如DL-Lite本体，是基于本体的数据访问的一种突出方法。在现实场景中，通常情况是用户询问他们稍后细化的初始查询，例如，通过使用新的约束来扩展它，使其初始请求更加精确。到目前为止，所有DL-Lite系统都需要从头开始处理新查询。在本文中，我们研究的问题，计算重写的扩展查询“扩展”以前计算重写的初始查询，避免重新计算。有趣的是，我们的方法也意味着一个新的算法计算重写一个固定的查询。更准确地说，查询可以被“分解”成它的原子，然后每个原子可以被增量地处理。我们提出了详细的算法，几个优化，以提高我们的查询重写算法的性能，最后，实验评估。
Query rewritingover lightweight ontologies, like DL-Lite ontologies, is a prominent approach for ontology-based data access. It is often the case in realistic scenarios that users ask an initial query which they later refine, e.g., by extending it with new constraints making their initial request more precise. So far, all DL-Lite systems would need to process the new query from scratch. In this paper, we study the problem of computing the rewriting of an extended query by ‘extending’ a previously computed rewriting of the initial query and avoiding recomputation. Interestingly, our approach also implies a novel algorithm for computing the rewriting of a fixed query. More precisely, the query can be ‘decomposed’ into its atoms and then each atom can be processed incrementally. We present detailed algorithms, several optimisations for improving the performance of our query rewriting algorithm, and finally, an experimental evaluation.