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
|
| _version_ | 1797097940505853952 |
|---|---|
| author | Benedikt, M Kikot, S Ostropolski-Nalewaja, P Romero, M |
| author_facet | Benedikt, M Kikot, S Ostropolski-Nalewaja, P Romero, M |
| author_sort | Benedikt, M |
| collection | OXFORD |
| description | 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 special cases, such as for CQ views and queries [9, 23]. We investigate the situation for views and queries in the recursive query language Datalog. We give both positive and negative results about the ability to decide monotonic determinacy, and also about the co-incidence of monotonic determinacy with Datalog rewritability |
| first_indexed | 2024-03-07T05:02:30Z |
| format | Conference item |
| id | oxford-uuid:d8c5e629-9e0a-4caf-b1dc-fee25dc886e7 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T05:02:30Z |
| publishDate | 2020 |
| publisher | Association for Computing Machinery |
| record_format | dspace |
| spelling | oxford-uuid:d8c5e629-9e0a-4caf-b1dc-fee25dc886e72022-03-27T08:51:16ZOn monotonic determinacy and rewritability for recursive queries and viewsConference itemhttp://purl.org/coar/resource_type/c_5794uuid:d8c5e629-9e0a-4caf-b1dc-fee25dc886e7EnglishSymplectic ElementsAssociation for Computing Machinery2020Benedikt, MKikot, SOstropolski-Nalewaja, PRomero, MA 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 special cases, such as for CQ views and queries [9, 23]. We investigate the situation for views and queries in the recursive query language Datalog. We give both positive and negative results about the ability to decide monotonic determinacy, and also about the co-incidence of monotonic determinacy with Datalog rewritability |
| spellingShingle | Benedikt, M Kikot, S Ostropolski-Nalewaja, P Romero, M On monotonic determinacy and rewritability for recursive queries and views |
| title | On monotonic determinacy and rewritability for recursive queries and views |
| title_full | On monotonic determinacy and rewritability for recursive queries and views |
| title_fullStr | On monotonic determinacy and rewritability for recursive queries and views |
| title_full_unstemmed | On monotonic determinacy and rewritability for recursive queries and views |
| title_short | On monotonic determinacy and rewritability for recursive queries and views |
| title_sort | on monotonic determinacy and rewritability for recursive queries and views |
| work_keys_str_mv | AT benediktm onmonotonicdeterminacyandrewritabilityforrecursivequeriesandviews AT kikots onmonotonicdeterminacyandrewritabilityforrecursivequeriesandviews AT ostropolskinalewajap onmonotonicdeterminacyandrewritabilityforrecursivequeriesandviews AT romerom onmonotonicdeterminacyandrewritabilityforrecursivequeriesandviews |