Information Systems
An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
Constraint management in expert database systems
Proceedings from the first international workshop on Expert database systems
Implementation of a semantic integrity manager with a knowledge representation system
Proceedings from the first international workshop on Expert database systems
The role of constraints in databases, expert systems, and knowledge representation
Proceedings from the first international workshop on Expert database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Integrity checking for multiple updates
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
A relational model of data for large shared data banks
Communications of the ACM
Implementation of integrity constraints and views by query modification
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Database Security and Integrity
Database Security and Integrity
An approach to proving the correctness of data base operations
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
Specification and verification of data base semantic integrity.
Specification and verification of data base semantic integrity.
Database constraint enforcement: a decompositional approach
Database constraint enforcement: a decompositional approach
Fast maintenance of semantic integrity assertions using redundant aggregate data
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
| Hi-index | 0.00 |
This paper presents a decompositional approach to integrity constraint enforcement for very large database systems. The central theme of the paper is the development of the constraint decomposition theorem which can be used to decompose any complex constraint formula into a set of simpler constraint sub-formulas, each of which is a sufficient condition for the original constraint formula and they can be enforced independently of one another. By utilizing the decomposition theorem and the fact that both cost for checking each sub-formula and satisfiablity of each sub-formula may be different from one another, we developed a new constraint enforcement strategy which is much efficient than the previous approaches.