Recovery Techniques for Database Systems
ACM Computing Surveys (CSUR)
Efficient monitoring of database assertions
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
On interaction with data bases
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
HIGH LEVEL EXPRESSION OF SEMANTIC INTEGRITY SPECIFICATIONS IN A RELATIONAL DATA BASE SYSTEM
HIGH LEVEL EXPRESSION OF SEMANTIC INTEGRITY SPECIFICATIONS IN A RELATIONAL DATA BASE SYSTEM
Semantic integrity, consistency and concurrency control in distributed databases.
Semantic integrity, consistency and concurrency control in distributed databases.
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Rule-Based Consistency Enforcement for Knowledge-Based Systems
IEEE Transactions on Knowledge and Data Engineering
Using Versions in Update Transactions: Application to Integrity Checking
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Knowledge-based Integrity Constraint Validation
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Integrity Constraint Reformulation for Efficient Validation
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Distributed processing of data dynamics
ACM SIGMOD Record
| Hi-index | 0.00 |
A principal problem with dynamic validation of transactions with respect to a set of integrity assertions is the cost associated with the evaluation of such assertions. Although several methods of dynamic validation of transactions have been proposed there has been little attempt to analyze and to compare the performance of different validation methods. In this paper we evaluate compile time, run time, postexecution time, and mixed (run time --- postexecution time) validation methods for two semantic integrity subsystem designs. In one case we assume that the arguments of all integrity assertions are stored in secondary slow access memory and in the second we assume that the database is partitioned so that some data used for transaction validation are stored in fast access form.