Abstract
In a Datalog database, updates to intensionally defined relations give rise to problems similar to those related to view updates: it is often difficult them in an unambiguous way by means of updates to base relations. This paper gives two contributions to this problem: (i) the formalization of a declarative, model-theoretic semantics of insertions (and, dually, of deletions), with potential, minimal, and deterministic results; (ii) an operational, proof-theoretic approach that turns out to be equivalent to the declarative one, and so allows effective characterizations of the various properties of results, including determinism.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
