Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
Implementation of integrity constraints and views by query modification
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Efficient monitoring of database assertions
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Fast methods for testing quantified relational calculus assertions
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
AIM - An Integrity Monitor for the Database System INGRES
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Specification and verification of data base semantic integrity.
Specification and verification of data base semantic integrity.
ACM Transactions on Database Systems (TODS)
Parallel execution of integrity constraint checks
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
PRISMA/DB: A Parallel, Main Memory Relational DBMS
IEEE Transactions on Knowledge and Data Engineering
Towards DBMSs for Supporting New Applications
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Semantic Modeling of Object Oriented Databases
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Database design tools: an expert system approach
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Understanding the implications of view update policies
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
| Hi-index | 0.00 |
Tnls paper presents a powerful integrrty subsystem, which is implemented in the SABRE database system. The specification language is simple. Tne enforcement algorithm is general, in particular, it handles referential dependency and temporal assertions. Specialized strategies efficiently treat each class of assertions. The system automatically manages integrity checkpoints. Also, an efficient method is described for processing assertions involving aggregates. An analysis exhibits the value of the algorithms. It 1s shown that, in general, this method is better than the query modification method for domain assertions. Measures have also been done for giving the cost added for controlling integrity in comparison with the cost of the request itself.