On the Feasibility of Checking Temporal Integrity Constraints (1995)
| Citations: | 36 - 6 self |
BibTeX
@MISC{Chomicki95onthe,
author = {Jan Chomicki and Damian Niwinski},
title = {On the Feasibility of Checking Temporal Integrity Constraints},
year = {1995}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We analyze the computational feasibility of checking temporal integrity constraints formulated in some sublanguages of first-order temporal logic. Our results illustrate the impact of the quantifier pattern on the complexity of this problem. The presence of a single quantifier in the scope of a temporal operator makes the problem undecidable. On the other hand, if no quantifiers are in the scope of a temporal operator and all the quantifiers are universal, temporal integrity checking can be done in exponential time. 1 Introduction As temporal databases become more widely used in practice [27, 28], the need arises to address database integrity issues that are specific to such databases. In particular, it is necessary to generalize the standard notion of static integrity (involving single database states) to temporal integrity (involving sequences of database states). This work is the first attempt to date to analyze the computational feasibility of checking temporal integrity constrain...
