Journal article icon

Journal article

On monotonic determinacy and rewritability for recursive queries and views

Abstract:

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 [Nash et al. 2010; Benedikt et al. 2016]. We investigate the situation for views and queries in the recursive query language Datalog. We give both posit...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1145/3572836

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
University College
Role:
Author
More by this author
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Division:
MPLS
Department:
Computer Science
Role:
Author
More from this funder
Name:
Engineering and Physical Sciences Research Council
Funder identifier:
http://dx.doi.org/10.13039/501100000266
Grant:
EP/M005852/1
EP/T022124/1
Publisher:
Association for Computing Machinery
Journal:
ACM Transactions on Computational Logic More from this journal
Volume:
24
Issue:
2
Article number:
16
Publication date:
2023-01-05
Acceptance date:
2022-11-08
DOI:
EISSN:
1557-945X
ISSN:
1529-3785
Language:
English
Keywords:
Pubs id:
1300610
Local pid:
pubs:1300610
Deposit date:
2022-11-08

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP