On Monotonic Determinacy and Rewritability For Recursive Queries and Views
Summary: Studied monotonic determinacy for recursive Datalog views/queries—i.e., when a query is a monotone function of view instances—extending RA/UCQ results. Presents both decidability and undecidability results and shows monotonic determinacy can diverge from Datalog rewritability. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Michael Benedikt (University of Oxford)
- 2. Stanislav Kikot (University of Oxford)
- 3. Piotr Ostropolski-Nalewaja (University of Wrocław)
- 4. Miguel Romero (Adolfo Ibáñez University)
BibTeX Citation
@inproceedings{benedikt_pods20,
address = {New York, NY, USA},
series = {{PODS} '20},
title = {{On Monotonic Determinacy and Rewritability For Recursive Queries and Views}},
url = {https://dl.acm.org/doi/10.1145/3375395.3387661},
doi = {10.1145/3375395.3387661},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Benedikt, Michael and Kikot, Stanislav and Ostropolski-Nalewaja, Piotr and Romero, Miguel},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 69 | Answering Queries Using Views (Extended Abstract) | 1995 | PODS | 0.00038090878 |
| 3,245 | On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs | 1994 | PODS | 7.60327e-05 |
| 3,717 | Lossless Regular Views | 2002 | PODS | 7.1752078e-05 |
| 7,356 | Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable. | 2016 | PODS | 5.6348348e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,430 | A Theory of Regular Queries | 2016 | PODS |
| 2 | 1,630 | On the Decidability of Query Containment under Constraints | 1998 | PODS |
| 3 | 6,613 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |
| 4 | 5,361 | Answering Queries Using Views with Arithmetic Comparisons | 2002 | PODS |
| 5 | 12,029 | Bounded Query Rewriting Using Views | 2016 | PODS |
| 6 | 7,972 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS |
| 7 | 6,926 | On the Decidability of Containment of Recursive Datalog Queries - Preliminary report | 2004 | PODS |
| 8 | 2,527 | Rewriting Queries Using Views in Description Logics | 1997 | PODS |
| 9 | 515 | Answering Recursive Queries Using Views | 1997 | PODS |
| 10 | 1,991 | Views and Queries: Determinacy and Rewriting | 2005 | PODS |