论文标题
关于递归查询和视图的单调决定性和重写性
On monotonic determinacy and rewritability for recursive queries and views
论文作者
论文摘要
如果Q可以作为视图图像的单调函数表示，则在一组视图上单调确定查询Q。在关系代数观点和查询的情况下，单调的决定性与重写作为连接查询的结合，并且在重要的特殊情况下是可以决定的，例如CQ观点和查询。我们研究了递归查询语言数据数据中的观点和查询的情况。我们对决定单调决定性的能力以及单调确定性与DataLog重写能力的共同构成给出了正面和负面的结果。
A query Q is monotonically determined over a set of views if Q can be expressed as a monotonic function of the view image. In the case of relational algebra views and queries, monotonic determinacy coincides with rewritability as a union of conjunctive queries, and it is decidable in important special cases, such as for CQ views and queries. We investigate the situation for views and queries in the recursive query language Datalog. We give both positive and negative results about the ability to decide monotonic determinacy, and also about the co-incidence of monotonic determinacy with Datalog rewritability.
