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)