Database Paper Browser

Back to papers

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)

Paper ID
1792
Venue
PODS
Year
2020
Pagerank
4.1945683e-05
Overall Rank
11,558 | 19.60%
DOI
10.1145/3375395.3387661

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers