On the decidability of containment of recursive datalog queries - preliminary report
On the decidability of containment of recursive datalog queries - preliminary report
复制标题
关于递归数据记录查询的遏制的可判定性 - 初步报告
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
P. Bonatti
中科院分区：
文献类型：
--
作者：
P. Bonatti
查询包含的判定问题在经典查询优化和异构数据库系统中有着重要的应用。对于无限制递归查询，查询包含是不可判定的，而对于递归一元查询和正则路径表达式上的连接查询，查询包含则是可判定的。在本文中，我们确定了一类具有可判定包含性的新递归查询。我们的框架支持两个以上参数的递归谓词和非线性递归，从而扩展了上述查询类。
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unrestricted recursive queries, and decidable for recursive monadic queries and conjunctive queries over regular path expressions. In this paper, we identify a new class of recursive queries with decidable containment. Our framework extends the aforementioned query classes by supporting recursive predicates with more than two arguments and nonlinear recursion.