Monotone Rewritability and the Analysis of Queries, Views, and Rules
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916331401510912 |
|---|---|
| author | Benedikt, Michael Kikot, Stanislav Marti, Johannes Ostropolski-Nalewaja, Piotr |
| author_facet | Benedikt, Michael Kikot, Stanislav Marti, Johannes Ostropolski-Nalewaja, Piotr |
| contents | We study the interaction of views, queries, and background knowledge in the form of existential rules. The motivating questions concern monotonic determinacy of a query using views w.r.t. rules, which refers to the ability to recover the query answer from the views via a monotone function. We study the decidability of monotonic determinacy, and compare with variations that require the ``recovery function'' to be in a well-known monotone query language, such as conjunctive queries or Datalog. Surprisingly, we find that even in the presence of basic existential rules, the borderline between well-behaved and badly-behaved answerability differs radically from the unconstrained case. In order to understand this boundary, we require new results concerning entailment problems involving views and rules. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_14907 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Monotone Rewritability and the Analysis of Queries, Views, and Rules Benedikt, Michael Kikot, Stanislav Marti, Johannes Ostropolski-Nalewaja, Piotr Databases We study the interaction of views, queries, and background knowledge in the form of existential rules. The motivating questions concern monotonic determinacy of a query using views w.r.t. rules, which refers to the ability to recover the query answer from the views via a monotone function. We study the decidability of monotonic determinacy, and compare with variations that require the ``recovery function'' to be in a well-known monotone query language, such as conjunctive queries or Datalog. Surprisingly, we find that even in the presence of basic existential rules, the borderline between well-behaved and badly-behaved answerability differs radically from the unconstrained case. In order to understand this boundary, we require new results concerning entailment problems involving views and rules. |
| title | Monotone Rewritability and the Analysis of Queries, Views, and Rules |
| topic | Databases |
| url | https://arxiv.org/abs/2407.14907 |