Polynomial Rewritings for Linear Existential Rules
Polynomial Rewritings for Linear Existential Rules
复制标题
线性存在规则的多项式重写
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Andreas Pieris
中科院分区：
文献类型：
--
作者：
G. Gottlob;M. Manna;Andreas Pieris
我们考虑的情况下，基于本体的查询回答。人们普遍认为，在这种情况下，真正的可伸缩性只能通过查询重写来实现，而查询重写又允许利用标准RDBMS。在这项工作中，我们关闭两个开放的基本问题有关的查询重写。我们建立了线性存在规则是多项式组合的，而完整的线性规则是多项式（纯）的，在这两种情况下，目标查询语言由一阶或非递归的Datasheet查询。我们的结果的一个直接后果是DLR-LiteR，DL-LiteR与n元角色的扩展，是多项式组合的。
We consider the scenario of ontology-based query answering. It is generally accepted that true scalability in this setting can only be achieved via query rewriting, which in turn allows for the exploitation of standard RDBMSs. In this work, we close two open fundamental questions related to query rewriting. We establish that linear existential rules are polynomially combined rewritable, while full linear rules are polynomially (purely) rewritable; in both cases, the target query language consists of first-order or non-recursive Datalog queries. An immediate consequence of our results is that DLR-LiteR, the extension of DL-LiteR with n-ary roles, is polynomially combined rewritable.
影响因子：
14.4
作者：
Gottlob, Georg;Kikot, Stanislav;Zakharyaschev, Michael
通讯作者：
Zakharyaschev, Michael