On monotonic determinacy and rewritability for recursive queries and views
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 spe...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Language: | English |
| Published: |
Association for Computing Machinery
2020
|
Search Result 1
On monotonic determinacy and rewritability for recursive queries and views
Published 2023
Journal article