|
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
|
U. Dayal , B. Blaustein , A. Buchmann , U. Chakravarthy , M. Hsu , R. Ledin , D. McCarthy , A. Rosenthal , S. Sarin , M. J. Carey , M. Livny , R. Jauhari, The HiPAC project: combining active databases and timing constraints, ACM SIGMOD Record, v.17 n.1, p.51-70, March, 1988
[doi> 10.1145/44203.44208]
|
| |
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
|
Dov Gabbay , Amir Pnueli , Saharon Shelah , Jonathan Stavi, On the temporal analysis of fairness, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.163-173, January 28-30, 1980, Las Vegas, Nevada
[doi> 10.1145/567446.567462]
|
 |
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
|
N. H. Gehani , H. V. Jagadish , O. Shmueli, Event specification in an active object-oriented database, Proceedings of the 1992 ACM SIGMOD international conference on Management of data, p.81-90, June 02-05, 1992, San Diego, California, United States
|
| |
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
|
Paris C. Kanellakis , Gabriel M. Kuper , Peter Z. Revesz, Constraint query languages (preliminary report), Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.299-313, April 02-04, 1990, Nashville, Tennessee, United States
[doi> 10.1145/298514.298582]
|
| |
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
|
Guy M. Lohman , Bruce Lindsay , Hamid Pirahesh , K. Bernhard Schiefer, Extensions to Starburst: objects, types, functions, and rules, Communications of the ACM, v.34 n.10, p.94-109, Oct. 1991
[doi> 10.1145/125223.125266]
|
| |
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
|
Abdullah Uz Tansel , James Clifford , Shashi Gadia , Sushil Jajodia , Arie Segev , Richard Snodgrass, Temporal databases: theory, design, and implementation, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1993
|
| |
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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Lukasz Golab , Theodore Johnson , Nick Koudas , Divesh Srivastava , David Toman, Optimizing away joins on data streams, Proceedings of the 2nd international workshop on Scalable stream processing system, March 29-29, 2008, Nantes, France
|
|
|
|
|
|
|
|
|
Curtis Dyreson , Richard T. Snodgrass , Faiz Currim , Sabah Currim , Shailesh Joshi, Weaving temporal and reliability aspects into a schema tapestry, Data & Knowledge Engineering, v.63 n.3, p.752-773, December, 2007
|
|
|
|
|
|
|
|
|
|
|
|
Robert Craven , Jorge Lobo , Jiefei Ma , Alessandra Russo , Emil Lupu , Arosha Bandara, Expressive policy analysis with enhanced system dynamicity, Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, March 10-12, 2009, Sydney, Australia
|
|
|
|
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...
|