ACM Home Page
Please provide us with feedback. Feedback
Efficient checking of temporal integrity constraints using bounded history encoding
Full text PdfPdf (2.70 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 20 ,  Issue 2  (June 1995) table of contents
Pages: 149 - 186  
Year of Publication: 1995
ISSN:0362-5915
Author
Jan Chomicki  Computing and Information Sciences, Kansas State University, Manhattan, KS
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 51,   Citation Count: 20
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/210197.210200
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
 
4
 
5
 
6
 
7
BAUDINET, M., CHOMICKI, O., AND WOLPER, F. 1992. Temporal deductive databases. In Temporal Databases: Theory. Design, and Implementation, Tansel et al., Eds. Benjamin-Cummings, Redwood City, Calif., 294-320.
 
8
BERNSTEIN, P., BLAUSTEIN, B., AND CLARKE, E. 1980. Fast maintenance of semantic integrity assertions using redundant aggregate data. In International Conference on Very Large Data Bases. (Montreal), VLDB Endowment, 126-136.
 
9
 
10
CHOMICKI, J. 1994a. Temporal integrity constraints in relational databases. IEEE Data Eng. Bull. 17, 2 (June), 33-37.
 
11
 
12
13
14
15
 
16
17
 
18
CLIFFORD, J., CRO~R, A., AND TUZHmIN, A. 1993. On the completeness of query languages for grouped and ungrouped historical data models. In Temporal Databases: Theory, Design, and ImplementatLon, Tansel et al, Eds Benjamin Cummings, Redwood City, Calif., 496 533.
19
 
20
21
22
 
23
DUBOIS, E., HAGELSTEIN, J., AND RIFAUT, A. 1988. Formal reqmrements engineering with ERAE. Philips J Res. 43, 393 414.
 
24
 
25
 
26
27
28
 
29
GARSON, J. 1984. Quantification in modal logic. In Handbook of Phtlosophical Logic, D. Gabbay and F. Guenthner, Eds D. Reldel, NorweI1, Mass 249-307
 
30
31
 
32
 
33
HAREL, D. 1985 Recurring dominoes: Making the highly undecidable highly understandable. Ann. D~screte Math. 24, 51-71.
 
34
HAREL, E., L~CHTENSTEIN, O., AND PNUEH, A. 1990. Explicit clock temporal logic. In IEEE Sympos~ura on Logtc m Computer Science (Philadelphia, Pa)., IEEE Computer Society, Los Alam~tos, Calif., 402-443.
35
 
36
 
37
INTFmNATIONAL ORGANIZATION FOR STANDARmZAT~ON. 1992. Database Language SQL. ISO/IEC 9075:1992
 
38
KAMP, J. 1968. Tense logic and the theory of linear order. Ph.D. dissertation, University of California, Los Angeles.
39
 
40
 
41
KOYMANS, R. 1989. Specifying message passing and time-critical systems with temporal logic. Ph.D. dissertation, Technische Universiteit Eindhoven.
42
 
43
LIPECK, U., GERTZ, M., AND SAAKE, G. 1994. Transitional monitoring of dynamic integrity constraints. IEEE Data Eng. Bull. (June), 38-42.
 
44
45
 
46
 
47
48
 
49
 
50
NICOLAS, J.-M. 1982. Logic for improving integrity checking in relational databases. Acta Inf. 18, 3, 227-253.
 
51
 
52
 
53
54
 
55
 
56
 
57
58
 
59
 
60
 
61
 
62
TUZHILIN, A. 1993. Applications of temporal databases to knowledge-based simulations. In Temporal Databases: Theory, Design and Implementation, Tansel et el., Eds. Benjamin-Cum mings, Redwood City, Cahf, 580-593
 
63
TUZHmIN, A 1991. Temporal logic as a simulation language. In International Conference on Artificial Intelltgence and Simulatzon.
 
64
65
 
66
VARDI, M. AND WOLPER, P 1986. An automata-theoretic approach to automatic program verification. In IEEE Symposium on Logic in Computer Science, IEEE Computer Science Press.
 
67
V^RDI, M.Y. 1992. Personal communication.
68
 
69
 
70
WOLPER, P 1983. Temporallogic can be more expressive Inf Control 56, 72-99.

CITED BY  20


REVIEW

"Jaroslav Pokorny : Reviewer"

Temporal integrity constraints are examined in this paper. They are specified declaratively in a restricted version of first-order temporal logic (FOTL). Temporal constraints require checking not only the current database state but  more...