On monotonic determinacy and rewritability for recursive queries and views

Benedikt, Michael, Kikot, Stanislav, Ostropolski-Nalewaja, Piotr and Romero, Miguel (2020) On monotonic determinacy and rewritability for recursive queries and views. PODS 2020: Proceedings of 39th international conference on Principles of Database Systems.

2003.05898.pdf - Accepted Version

Download (1MB) | Preview
Official URL: https://dl.acm.org/doi/proceedings/10.1145/3375395

Abstract / Description

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.

Item Type: Article
Uncontrolled Keywords: monotonic determinacy; query Q; Datalog queries
Subjects: 000 Computer science, information & general works
Department: School of Computing and Digital Media
Depositing User: Stanislav Kikot
Date Deposited: 15 May 2020 11:55
Last Modified: 15 Mar 2021 12:56
URI: https://repository.londonmet.ac.uk/id/eprint/5792


Downloads per month over past year

Downloads each year

Actions (login required)

View Item View Item