Efficient checking of temporal integrity constraints using bounded history encoding
- 1 June 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 20 (2) , 149-186
- https://doi.org/10.1145/210197.210200
Abstract
We present an efficient implementation method for temporal integrity constraints formulated in Past Temporal Logic. Although the constraints can refer to past states of the database, their checking does not require that the entire database history be stored. Instead, every database state is extended with auxiliary relations that contain the historical information necessary for checking constraints. Auxiliary relations can be implemented as materialized relational views.Keywords
This publication has 35 references indexed in Scilit:
- Temporal triggers in active databasesIEEE Transactions on Knowledge and Data Engineering, 1995
- Monitoring temporal preconditions in a behaviour oriented object modelData & Knowledge Engineering, 1994
- On completeness of historical relational query languagesACM Transactions on Database Systems, 1994
- Real-time databasesDistributed and Parallel Databases, 1993
- Safety and translation of relational calculusACM Transactions on Database Systems, 1991
- Theoretical foundations of handling large substitution sets in temporal integrity monitoringActa Informatica, 1991
- Partitioned storage for temporal databasesInformation Systems, 1988
- Monitoring dynamic integrity constraints based on temporal logicInformation Systems, 1987
- The temporal query language TQuelACM Transactions on Database Systems, 1987
- The Recursive Unsolvability of the Decision Problem for the Class of Definite FormulasJournal of the ACM, 1969