On monotonic determinacy and rewritability for recursive queries and views

Ostropolski-Nalewaja Piotr
Ostropolski-Nalewaja Piotr
Romero Miguel
Romero Miguel

SIGMOD/PODS '20: International Conference on Management of Data Portland OR USA June, 2020, pp. 131-148, 2020.

Cited by: 0|Bibtex|Views14|Links
EI

Abstract:

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 queri...More

Code:

Data:

Your rating :
0

 

Tags
Comments