kyrie2: Query Rewriting under Extensional Constraints in ELHIO
kyrie2: Query Rewriting under Extensional Constraints in ELHIO
复制标题
kyrie2：ELHIO 中扩展约束下的查询重写
DOI：
10.1007/978-3-319-11964-9_36
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Óscar Corcho
中科院分区：
文献类型：
--
作者：
José Mora;R. Rosati;Óscar Corcho
本文研究了基于本体的数据访问中的查询应答和重写问题。具体来说，我们提出了一个算法，用于计算一个完美的重写工会的合取查询所提出的本体表示的描述逻辑ELHIO，它涵盖了OWL 2 QL和OWL 2 EL配置文件。我们的算法的新奇在于使用了一组ABox依赖关系，这些依赖关系被编译成一个所谓的EBox，以限制重写的扩展。到目前为止，EBox只在DL-Lite的情况下用于查询重写，DL-Lite的表达能力不如ELHIO。我们已经广泛地评估了我们的新的查询重写技术，在本文中，我们讨论了减少重写的大小和我们的方法的计算成本之间的权衡。
In this paper we study query answering and rewriting in ontologybased data access. Specifically, we present an algorithm for computing a perfect rewriting of unions of conjunctive queries posed over ontologies expressed in the description logic ELHIO, which covers the OWL 2 QL and OWL 2 EL profiles. The novelty of our algorithm is the use of a set of ABox dependencies, which are compiled into a so-called EBox, to limit the expansion of the rewriting. So far, EBoxes have only been used in query rewriting in the case of DL-Lite, which is less expressive than ELHIO. We have extensively evaluated our new query rewriting technique, and in this paper we discuss the tradeoff between the reduction of the size of the rewriting and the computational cost of our approach.