Efficient Checking of Temporal Integrity Constraints Using Bounded History Encoding (1995)
| Citations: | 72 - 6 self |
BibTeX
@MISC{Chomicki95efficientchecking,
author = {Jan Chomicki},
title = {Efficient Checking of Temporal Integrity Constraints Using Bounded History Encoding},
year = {1995}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1 Introduction Integrity constraints form an essential part of every database application. It is customary to distinguish between two kinds of constraints: static and temporal (or dynamic). Static constraints refer to the current state of the database, e.g.,"every manager is also an employee ", while temporal constraints may refer to past and future states in addition to the current state, e.g., "salaries of employees should never decrease" or "once a student drops out of the Ph.D. program, she should not be readmit...
