Intensional updates: abduction via deduction
Logic programming
A theory for rule triggering systems
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
Consistency management in a project management assistant
SDE 4 Proceedings of the fourth ACM SIGSOFT symposium on Software development environments
Semantics with applications: a formal introduction
Semantics with applications: a formal introduction
The deductive synthesis of database transactions
ACM Transactions on Database Systems (TODS)
Termination and confluence of rule execution
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Automatic generation of production rules for integrity maintenance
ACM Transactions on Database Systems (TODS)
Materialized view maintenance and integrity constraint checking: trading space for time
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Patterns of self-stabilization in database consistency maintenance
Data & Knowledge Engineering - Special issue: next generation information technologies and systems
Consistency enforcement in entity-relationship and object-oriented models
Data & Knowledge Engineering - Special issue on ER '97
Enhancing the ER model with integrity methods
Journal of Database Management - Special issue on information modeling methods
An algebraic approach to static analysis of active database rules
ACM Transactions on Database Systems (TODS)
Thémis: a database programming language handling integrity constraints
The VLDB Journal — The International Journal on Very Large Data Bases - Persistent object systems
Effect Preservation as a Means for Achieving Update Consistency
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Checking Consistency of Database Constraints: a Logical Basis
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Deriving Production Rules for Constraint Maintainance
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
An Algebraic Approach to Rule Analysis in Expert Database Systems
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Further Improvements on Integrity Constraint Checking for Stratifiable Deductive Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Automatic Rule Generation for Constraint Enforcement in Active Databases
Selected Papers from the Fourth International Workshop on Foundations of Models and Languages for Data and Objects: Modelling Database Dynamics
Structuring the Process of Integrity Maintenance
DEXA '97 Proceedings of the 8th International Conference on Database and Expert Systems Applications
Towards effect preservation of updates with loops
Integrity and internal control in information systems V
Static composition of refactorings
Science of Computer Programming - Special issue on program transformation
Consistency enforcement in databases
Proceedings of the 2nd international conference on Semantics in databases
Hi-index | 0.01 |
Rules provide an expressive means for implementing database behavior: They cope with changes and their ramifications. Rules are commonly used for integrity enforcement, i.e., for repairing database actions in a way that integrity constraints are kept. Yet, Rule Triggering Systems fall short in enforcing effect preservation, i.e., guaranteeing that repairing events do not undo each other, and in particular, do not undo the original triggering event. A method for enforcement of effect preservation on updates in general rule triggering systems is suggested. The method derives transactions from rules, and then splits the work between compile time and run time. At compile time, a data structure is constructed, that analyzes the execution sequences of a transaction and computes minimal conditions for effect preservation. The transaction code is augmented with instructions that navigate along the data structure and test the computed minimal conditions. This method produces minimal effect preserving transactions, and under certain conditions, provides meaningful improvement over the quadratic overhead of pure run time procedures. For transactions without loops, the run time overhead is linear in the size of the transaction, and for general transactions, the run time overhead depends linearly on the length of the execution sequence and the number of loop repetitions. The method is currently being implemented within a traditional database system.