Efficiently monitoring relational databases
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
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
Efficient monitoring of database assertions
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
An Introduction to Database Systems
An Introduction to Database Systems
On the modes and meaning of feedback to transaction designers
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Automatic verification of database transaction safety
ACM Transactions on Database Systems (TODS)
Local verification of global integrity constraints in distributed databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Database theory for supporting specification-based database system development
ICSE '85 Proceedings of the 8th international conference on Software engineering
Range nesting: a fast method to evaluate quantified queries
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Specification and verification of abstract database types
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Design and implementation of an extendible integrity subsystem
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Rule-Based Consistency Enforcement for Knowledge-Based Systems
IEEE Transactions on Knowledge and Data Engineering
Enforcing Inclusion Dependencies and Referencial Integrity
VLDB '88 Proceedings of the 14th 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
Semantics of Network Data Manipulation Languages: An Object-Oriented Approach
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
Translating advanced integrity checking technology to SQL
Database integrity
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
A generalized method for maintaining views
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
Runtime checking for program verification
RV'07 Proceedings of the 7th international conference on Runtime verification
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
Hi-index | 0.01 |
Semantic integrity assertions are predicates that define consistent states. A database system enforces assertions by ensuring that consistency is maintained as the database is updated.Most research on the efficient enforcement of assertions has concentrated on assertion simplification algorithms --- algorithms that produce simplified assertions that can be evaluated before the update is executed. This paper describes a strategy for further improving the efficiency of assertion enforcement.We develop an efficient algorithm for evaluating an assertion produced by an assertion simplification algorithm. We characterize a class of assertions that can be evaluated using a simple two-step procedure. The first step defines and evaluates simple selection queries on each relation. The second step applies set emptiness tests to the results of these selections. We also show how these techniques may be used to improve the efficiency of evaluating assertions outside our class.