Independence of logic database queries and update
C Elkan - Proceedings of the ninth ACM SIGACT-SIGMOD …, 1990 - dl.acm.org
Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of …, 1990•dl.acm.org
A query is independent of an update if executing the update cannot change the result of
evaluating the query. The theorems of this paper give methods for proving independence in
concrete cases, taking into account integrity constraints, recursive rules, and arbitrary
queries. First we define the notion of independence model-theoretically, and we prove basic
properties of the concept. Then we provide proof-theoretic conditions for a conjunctive query
to be independent of an update. Finally, we prove correct an induction scheme for showing …
evaluating the query. The theorems of this paper give methods for proving independence in
concrete cases, taking into account integrity constraints, recursive rules, and arbitrary
queries. First we define the notion of independence model-theoretically, and we prove basic
properties of the concept. Then we provide proof-theoretic conditions for a conjunctive query
to be independent of an update. Finally, we prove correct an induction scheme for showing …
A query is independent of an update if executing the update cannot change the result of evaluating the query. The theorems of this paper give methods for proving independence in concrete cases, taking into account integrity constraints, recursive rules, and arbitrary queries. First we define the notion of independence model-theoretically, and we prove basic properties of the concept. Then we provide proof-theoretic conditions for a conjunctive query to be independent of an update. Finally, we prove correct an induction scheme for showing that a recursive query is independent of an update.
ACM Digital LibraryShowing the best result for this search. See all results