On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Deriving production rules for constraint maintenance
Proceedings of the sixteenth international conference on Very large databases
Referential integrity revisited: an object-oriented perspective
Proceedings of the sixteenth international conference on Very large databases
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
The alternating fixpoint of logic programs with negation
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantics and expressiveness issues in active databases (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Referential actions as logical rules
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A relational model of data for large shared data banks
Communications of the ACM
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Relational Database Writings, 1991-1994
Relational Database Writings, 1991-1994
A Guide to the SQL Standard, 3rd Ed.; A User's Guide to the Standard Relational Lanquage SQL
A Guide to the SQL Standard, 3rd Ed.; A User's Guide to the Standard Relational Lanquage SQL
Referential Actions: From Logical Semantics to Implementation
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
A Run-Time Execution Model for Referential Integrity Maintenance
Proceedings of the Eighth International Conference on Data Engineering
Practical Applications of Triggers and Constraints: Success and Lingering Issues (10-Year Award)
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Implementing Set-Oriented Production Rules as an Extension to Starburst
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Safe Referential Structures in Relational Databases
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Integrating Triggers and Declarative Constraints in SQL Database Sytems
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Ambiguity for Referential Integrity Is Undecidable
Proceedings of the ESPRIT WG CONTESSA Workshop on Constraint Databases and Applications
The Expressive Power of Partial Models in Disjunctive Deductive Databases
LID '96 Proceedings of the International Workshop on Logic in Databases
Nested Transactions in a Logical Language for Active Rules
LID '96 Proceedings of the International Workshop on Logic in Databases
Minimal-change integrity maintenance using tuple deletions
Information and Computation
Minimal-change integrity maintenance using tuple deletions
Information and Computation
PROPUB: towards a declarative approach for publishing customized, policy-aware provenance
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Declarative semantics of production rules for integrity maintenance
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Hi-index | 0.00 |
Referential actions are specialized triggers for automatically maintaining referential integrity in databases. While the local effects of referential actions can be grasped easily, it is far from obvious what the global semantics of a set of interacting referential actions should be. In particular, when using procedural execution models, ambiguities due to the execution ordering can occur. No global, declarative semantics of referential actions has yet been defined.We show that the well-known logic programming semantics provide a natural global semantics of referential actions that is based on their local characterization: To capture the global meaning of a set RA of referential actions, we first define their abstract (but non-constructive) intended semantics. Next, we formalize RA as a logic program PRA. The declarative, logic programming semantics of PRA then provide the constructive, global semantics of the referential actions. So, we do not define a semantics for referential actions, but we show that there exists a unique natural semantics if one is ready to accept (i) the intuitive local semantics of local referential actions, (ii) the formalization of those and of the local "effect-propagating" rules, and (iii) the well-founded or stable model semantics from logic programming as "reasonable" global semantics for local rules.We first focus on the subset of referential actions for deletions only. We prove the equivalence of the logic programming semantics and the abstract semantics via a game-theoretic characterization, which provides additional insight into the meaning of interacting referential actions. In this case a unique maximal admissible solution exists, computable by a ptime algorithm.Second, we investigate the general case---including modifications. We show that in this case there can be multiple maximal admissible subsets and that all maximal admissible subsets can be characterized as 3-valued stable models of PRA. We show that for a given set of user requests, in the presence of referential actions of the form ON UPDATE CASCADE, the admissibility check and the computation of the subsequent database state, and (for non-admissible updates) the derivation of debugging hints all are in ptime. Thus, full referential actions can be implemented efficiently.