On Monotonic Determinacy and Rewritability for Recursive Queries and Views-Reference-Cited by-同舟云学术

On Monotonic Determinacy and Rewritability for Recursive Queries and Views

Published:2023-03-17 Issue:2 Volume:24 Page:1-62
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Benedikt Michael¹^ORCID,Kikot Stanislav²^ORCID,Ostropolski-Nalewaja Piotr³^ORCID,Romero Miguel⁴^ORCID

Affiliation:

1. University of Oxford, Oxford, United Kingdom

2. Institute for Information Transmission Problems, Russia

3. University of Wroclaw, Poland

4. Universidad Adolfo Ibáñez, Chile

Abstract

A query Q is monotonically determined over a set of views V 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 conjunctive query 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.

Funder

Engineering and Physical Sciences Research Council

National Science Centre

Fondecyt

National Center for Artificial Intelligence CENIA

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3572836

Reference32 articles.

1. Determinacy and query rewriting for conjunctive queries and views

2. On the Power of k-Consistency

3. Constraint Propagation as a Proof System