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...
Autors principals: | Benedikt, M, Kikot, S, Ostropolski-Nalewaja, P, Romero, M |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
Association for Computing Machinery
2023
|
Ítems similars
-
On monotonic determinacy and rewritability for recursive queries and views
per: Benedikt, M, et al.
Publicat: (2020) -
On monotonic determinacy and rewritability for recursive queries and views
per: Benedikt, Michael, et al.
Publicat: (2020) -
Monotone rewritability and the analysis of queries, views, and rules
per: Benedikt, M, et al.
Publicat: (2024) -
Determinacy and rewriting of functional top–down and MSO tree transformations
per: Benedikt, M, et al.
Publicat: (2016) -
On the succinctness of query rewriting over shallow ontologies
per: Kikot, Stanislav, et al.
Publicat: (2014)