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 auxdiary relations that contain the historical information necessary for checking constraints. Auxiliary relations can be implemented as materialized relational views. © 1995, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
Chomicki, J. (1995). Efficient Checking of Temporal Integrity Constraints Using Bounded History Encoding. ACM Transactions on Database Systems (TODS), 20(2), 149–186. https://doi.org/10.1145/210197.210200
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.