On monotonic determinacy and rewritability for recursive queries and views
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 speci...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
ACM Press
2020
|
| Subjects: | |
| Online Access: | https://repository.londonmet.ac.uk/5792/1/2003.05898.pdf |