Dependencies to Optimize Ontology Based Data Access
Dependencies to Optimize Ontology Based Data Access
复制标题
优化基于本体的数据访问的依赖关系
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Diego Calvanese
中科院分区：
文献类型：
--
作者：
M. Rodriguez;Diego Calvanese
基于本体的数据访问（OBDA）的查询回答可利用本体的Tbox的知识来处理ABOX的不完整（或数据源）。处理。冗余不仅是对决策程序的可进行的实施，而且还可以考虑执行时间的大量改进。 ]对于dl-litef，在Tbox中也存在角色包含物的情况。依赖关系，我们可以使用这些来优化DL-Litea Tbox，我们可以在OBDA系统中创建似乎是完整的W.R.T的Abox存储库。我们要根据DL-Litea设计OBDA系统，其中冗余最小，查询答案的指数方面明显减少，并且可以有效地使用现有的RDBMS。
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answering techniques with DL-Lite require exponential size query reformulations, or expensive data pre-processing. Also, these techniques present severe redundancy issues when dealing with ABoxes that are already (partially) complete. It has been shown that addressing redundancy is not only required for tractable implementations of decision procedures, but may also allow for sizable improvements in execution times. Considering the previous observations, in this paper we extend the results aiming at improving query answering performance in OBDA systems that were developed in [9] for DL-LiteF , to the case where also role inclusions are present in the TBox. Specifically, we first show that we can characterize completeness of an ABox by means of dependencies, and that we can use these to optimize DL-LiteA TBoxes. Second, we show that in OBDA systems we can create ABox repositories that appear to be complete w.r.t. a significant portion of any DL-LiteA TBox. The combination of these results allows us to design OBDA systems based on DL-LiteA in which redundancy is minimal, the exponential aspect of query answering is notably reduced and that can be implemented efficiently using existing RDBMSs.