Query Rewriting under Extensional Constraints in DL-Lite
Query Rewriting under Extensional Constraints in DL-Lite
复制标题
DL-Lite 中扩展约束下的查询重写
DOI：
10.1007/978-3-642-30284-8_31
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
R. Rosati
中科院分区：
文献类型：
--
作者：
R. Rosati
在本文中，我们提出了Prexto，一个算法计算一个完美的重写联盟的合取查询的本体表示的描述逻辑DL-Lite。Prexto的主要新奇在于，它构成了第一个查询重写本体充分利用扩展约束优化查询重写的技术。此外，Prexto利用功能性角色公理和概念与角色不相交性公理来优化重写查询的大小。我们表明，这些优化允许Prexto在实际情况下优于现有的查询重写技术的DL-Lite。
In this paper we present Prexto, an algorithm for computing a perfect rewriting of unions of conjunctive queries over ontologies expressed in the description logic DL−Lite. The main novelty of Prexto lies in the fact that it constitutes the first technique for query rewriting over ontologies which fully exploits extensional constraints to optimize query rewriting. In addition, Prexto makes use of functional role axioms and of concept and role disjointness axioms to optimize the size of the rewritten query. We show that these optimizations allow Prexto to outperform the existing query rewriting techniques for DL−Lite in practical cases.