On Monotonic Determinacy and Rewritability for Recursive Queries and Views

Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

Resumen

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 queries. 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.

Idioma originalInglés
Título de la publicación alojadaPODS 2020 - Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
EditorialAssociation for Computing Machinery
Páginas131-148
Número de páginas18
ISBN (versión digital)9781450371087
DOI
EstadoPublicada - 14 jun. 2020
Publicado de forma externa
Evento39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2020 - Portland, Estados Unidos
Duración: 14 jun. 202019 jun. 2020

Serie de la publicación

NombreProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Conferencia

Conferencia39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2020
País/TerritorioEstados Unidos
CiudadPortland
Período14/06/2019/06/20

Huella

Profundice en los temas de investigación de 'On Monotonic Determinacy and Rewritability for Recursive Queries and Views'. En conjunto forman una huella única.

Citar esto