A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic generation of production rules for integrity maintenance
ACM Transactions on Database Systems (TODS)
The role of abduction in database view updating
Journal of Intelligent Information Systems
An execution model for limited ambiguity rules and its application to derived data update
ACM Transactions on Database Systems (TODS)
Consistency enforcement in entity-relationship and object-oriented models
Data & Knowledge Engineering - Special issue on ER '97
An arithmetic theory of consistency enforcement
Acta Cybernetica
Updating knowledge bases while maintaining their consistency
The VLDB Journal — The International Journal on Very Large Data Bases
On Updates and Inconsistency Repairing in Knowledge Bases
Proceedings of the Ninth International Conference on Data Engineering
Integrity Enforcement in Object-Oriented Databases
Selected Papers from the Fourth International Workshop on Foundations of Models and Languages for Data and Objects: Modelling Database Dynamics
Dealing with Modification Requests During View Updating and Integrity Constraint Maintenance
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Maximal Expansions of Database Updates
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Operational semantics of transactions
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
| Hi-index | 0.00 |
The idea to enforce consistency in databases tries to overcome widely known weaknesses for consistency checking and verification techniques. In general terms, a database transition S is systematically modified to a new transition SI (greatest consistent specialization, GCS) that is provably consistent with respect to a given static constraint I, preserves the effects of S and is maximal with these properties.Effect preservation has been formalized by the operational specialization order 驴 on (semantic equivalence classes of) database transitions. Its simplicity makes it possible to establish a well-founded theory for reasonably large classes of database programs and static constraints. However, the specialization order may be criticized in some aspects, in particular in its coarseness.We characterize specialization of a database transition S by the preservation of all transition constraints that S satisfies (驴-constraints). This enables us to weaken the original order 驴 leading to the central definition of maximal consistent effect preservers (MCEs). We proof a normal form result for MCEs that relates them to GCSs and implies existence and uniqueness. This close relationship suggests the conjecture that there is a theory for MCEs similar to the GCS theory. We support this statement by showing that an MCE with respect to a set of static constraints can be enforced sequentially, and independently from the given order.