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...
Главные авторы: | Benedikt, M, Kikot, S, Ostropolski-Nalewaja, P, Romero, M |
---|---|
Формат: | Journal article |
Язык: | English |
Опубликовано: |
Association for Computing Machinery
2023
|
Схожие документы
-
On monotonic determinacy and rewritability for recursive queries and views
по: Benedikt, M, и др.
Опубликовано: (2020) -
On monotonic determinacy and rewritability for recursive queries and views
по: Benedikt, Michael, и др.
Опубликовано: (2020) -
Monotone rewritability and the analysis of queries, views, and rules
по: Benedikt, M, и др.
Опубликовано: (2024) -
Determinacy and rewriting of functional top–down and MSO tree transformations
по: Benedikt, M, и др.
Опубликовано: (2016) -
On the succinctness of query rewriting over shallow ontologies
по: Kikot, Stanislav, и др.
Опубликовано: (2014)