Jan Chomicki
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.
- ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, Mass. Google Scholar
Digital Library
- AKIN, I. ANn SNODC~RASS, R. 1988. Partitioned storage for temporal databases. Inf. Syst 13, 4, 369-391. Google ScholarDigital Library
- ALLEN, J. 1983. Maintaining knowledge about temporal intervals. Commun. ACM 26, 11 (November), 832-843. Google ScholarDigital Library
- ALUR, R. AND HENZINGER, T. 1998. Real-time logics: Complexity and expressiveness. Inf. Comput. 104, 35 77. Google ScholarDigital Library
- ALUR, R. AND HE~ZlNGER, T. 1992. Logics and models of real-t~me: A survey, In Real-Tzme Theory in Practice. LNCS 600, Springer-Verlag, New York, 74-106 Google ScholarDigital Library
- APT, K., BLAIR, H., AND WALKER, A. 1988. Towards a theory of declarative knowledge. In Foundattons of Deductive Databases and Logic Programmtng, J. Minker, Ed, Morgan Kaufmann, San Mateo, Calif., 89-148. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- CERI, S. AND WIDOM, J. 1991. Deriving production rules for incremental view maintenance. In International Conference on Very Large Data Bases. (Barcelona), VLDB Endowment, 577-589. Google ScholarDigital Library
- CHOMICKI, J. 1994a. Temporal integrity constraints in relational databases. IEEE Data Eng. Bull. 17, 2 (June), 33-37.Google Scholar
- CHOMICKI, J, 1994b. Temporal query languages: A survey. In Temporal Logw, First International Con/krence, D. Gabbay and H. Ohlbach, Eds., LNAI 827, Springer-Verlag, New York, 506-534. Google ScholarDigital Library
- CHOMICKi, J. 1992a. History-less checking of dynamic integrity constraints. In IEEE Internetlonal Conference on Data Engineering (Phoenix, Ariz., Feb.), 557-564. Google ScholarDigital Library
- CHOMICK~, J. 1992b. Real-time integrity constraints. In ACM Symposium on Princtples of Database Systems (San Diego, Calif., June). ACM, New York, 274-282. Google ScholarDigital Library
- CHOMICKL J. AND IMIELIi~SKI, T. 1988. Temporal deductive databases and lnfimte objects. In ACM Symposium on Principles of Database Systems (Austin, Tex., March}. ACM, New York, 61-73. Google ScholarDigital Library
- C~omcKL J. AND N~WI~SKI, D. 1993. On the feasibility of checking temporal integrity constraints. In ACM Symposium on Principles of Database Systems (Washington, D.C., May) ACM, New York. To appear in J. Comput, SYst. Sct. Google ScholarDigital Library
- CMOMICKI, J. AND TOMAN, D. 1994/1995. Implementing temporal integrity constraints using an active DBMS IEEE Trans Knowl. Data Eng. (August 1995). Google ScholarDigital Library
- CLIFFORD, J., CROKER, A., AND TUZHILIN, A. 1994. On completeness of historical relational query languages. ACM Trans. Database Syst. 19, i (March), 64-116. Google ScholarDigital Library
- 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.Google Scholar
- DAYAL, U., BLAUSTEIN, B., BUCHMANN, A., CHAKRAVARTHY, U., Hsu, M, LEDIN, R., MCCARTHY, A., ROSENTHAL, A. SARIN, S. CAGEY, M. J., LIVid', M., AND JAUHARI, R. 1988. The HiPAC project: Combining active databases and timing constraints SIGMOD Rec. 17, 1 (March), 51-70. Google ScholarDigital Library
- DE CASTILHO, J., CASANOVA, M., AND FURTADO, A 1982 A temporal framework for database specifications. In International Conference on Very Large Data Bases (Mexico City), VLDB Endowment, 280-291. Google ScholarDigital Library
- DEMOLOMBE, R. 1992. Syntactical characterization of a subset of domain independent formulas J. ACM 39, 1 (Jan.), 71-94. Google ScholarDigital Library
- DI PAOLA, R. 1969 The recursive unsolvability of the decision problem for the class of defimte formulas. J. ACM 16, 2, 324-327. Google ScholarDigital Library
- DUBOIS, E., HAGELSTEIN, J., AND RIFAUT, A. 1988. Formal reqmrements engineering with ERAE. Philips J Res. 43, 393 414.Google Scholar
- EMERSON, E. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed., vol. B. Elsevmr/MIT Press. 995-1072. Google ScholarDigital Library
- GASBA~, D., HODKINSON, I., AND RE~OLDS, M. 1994. Temporal Logtc: Mathematical Foundations and Computational Aspects. Oxford University Press, New York. Google ScholarDigital Library
- GABBAY, D AND MCBRmN, P 1991 Temporal logic and historical databases. In Internatmnal Conference on Very Large Data Bases (Barcelona), VLDB Endowment, 423-430 Google ScholarDigital Library
- GABBAY, D., PNUELI, A., SHELAH, S., AND STAVI, S. 1980. On the temporal analysis of fairness. In ACM Symposmm on Principles of Programming Languages. ACM, New York, 163-173. Google ScholarDigital Library
- GALLAmE, H., M~NY, ER, J., AND NICOLAS, J. 1984. Logic and databases: A deductive approach. ACM Comput. Surv. 16, 2 (June), 153-185. Google ScholarDigital Library
- GARSON, J. 1984. Quantification in modal logic. In Handbook of Phtlosophical Logic, D. Gabbay and F. Guenthner, Eds D. Reldel, NorweI1, Mass 249-307Google Scholar
- GEHANI, iN., JAGADISH, H., AND SHMUELI, O. 1992a. Composite event specification in active databases. Model & implementation. In }r~tcrr~atior~al Conferer~ce of Very Large Data Bases (Vancouver, B.C.), VLDB Endowment, 327-338. Google ScholarDigital Library
- GEHANI, N., JAGADISH, H., AND SHMUELI, O. 1992b. Event specification in an active objectorientation database. In ACM SIGMOD Internatmnal Conference on Management of Data (San Diego, Calif.), ACM, New York. 81-90. Google ScholarDigital Library
- GERTZ, M. AND LIPECK, U. 1993. Deriwng integrity maintaining triggers from transition graphs. In IEEE Jnternattonal Conference on Data Engineering (Vienna), 22-29. Google ScholarDigital Library
- HAREL, D. 1985 Recurring dominoes: Making the highly undecidable highly understandable. Ann. D~screte Math. 24, 51-71.Google Scholar
- 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.Google Scholar
- Hsu, A. AND IMmLIS~S~d, T. 1985. Integrity checking for multiple updates. In ACM SIGMOD International Conference on Management of Data (Austin, Tex ), ACM, New York, 152-168. Google ScholarDigital Library
- HOLSMANN, K. AND SAAKE, G. 1991. Theoretical foundations of handling large substitution sets m temporal integrity monitoring. Acta Inf. 28, 4. Google ScholarDigital Library
- INTFmNATIONAL ORGANIZATION FOR STANDARmZAT~ON. 1992. Database Language SQL. ISO/IEC 9075:1992Google Scholar
- KAMP, J. 1968. Tense logic and the theory of linear order. Ph.D. dissertation, University of California, Los Angeles.Google Scholar
- KANELLAKIS, P., KUPER, G., AND REVESZ, P. 1990. Constraint query languages. In ACM Symposium on Principles of Database Systems (Nashville, Tenn., April), ACM, New York, 299-313. To appear in J. Comput. Syst. Sci. Google ScholarDigital Library
- KOYMANS, R. 1990. Specifying real-time properties with metric temporal logic. Real-Time Syst. 2, 4, 255-299. Google ScholarDigital Library
- KOYMANS, R. 1989. Specifying message passing and time-critical systems with temporal logic. Ph.D. dissertation, Technische Universiteit Eindhoven.Google Scholar
- KUNG, C. 1985. On verification of database temporal constraints. In ACM SIGMOD International Conference on Management of Data (Austin, Tex.). ACM, New York, 169-179. Google ScholarDigital Library
- LIPECK, U., GERTZ, M., AND SAAKE, G. 1994. Transitional monitoring of dynamic integrity constraints. IEEE Data Eng. Bull. (June), 38-42.Google Scholar
- LIPECK, U. AND SAAKE, G. 1987. Monitoring dynamic integrity constraints based on temporal logic. Inf. Syst. 12, 3,255-269. Google ScholarDigital Library
- LOHMAN, G., LINDSAY, B., PIRAHESH, H., AND SCHIEFER, K. 1991. Extensions to starburst: Objects, types, functions and rules. Commun. ACM 34, 10 (Oct.), 94-109. Google ScholarDigital Library
- MANNA, Z. AND PNUELI, A. 1992. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, New York. Google ScholarDigital Library
- MANNA, Z. AND PNUELI, A. 1989. The anchored version of the temporal framework. In Linear Time, Branching Time and Parttal Order in Logics and Models for Concurrency, J. de Bakker, W.-P. de Roever, and G. Rozenberg, Eds., LNCS 354, Springer-Verlag, New York, 201-284. Google ScholarDigital Library
- MORZENTI, A., MANDRIOLI, D., AND GHEZZI, G. 1992. A model parametric real-time logic. ACM Trans. Program. Lang. Syst. 14, 4 (Oct.), 521-574. Google ScholarDigital Library
- NASSOR, E. AND VIDAL-NAQUET, G. 1992. Suitability of the propositional temporal logic to express properties of real-time systems. In Symposium on Theoretical Aspects of Computer Science. Springer-Verlag, New York, 59 70. Google ScholarDigital Library
- NICOLAS, J.-M. 1982. Logic for improving integrity checking in relational databases. Acta Inf. 18, 3, 227-253.Google ScholarDigital Library
- PNUELI, A. 1986. Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends. In Current Trends ~n Concurrency. LNCS 224, Springer- Verlag, New York, 510 584. Google ScholarDigital Library
- QIAN, X. 1988. An effective method for integrity constraint reformulation. In IEEE International Conference on Data Engineering (Los Angeles, Calif.), IEEE Computer Science Press, Washington, D.C., 338-345. Google ScholarDigital Library
- QIAN, X. AND SMITH, D. 1987. Integrity constraint reformulation for efficient validation. In International Conference on Very Large Data Bases (Brighton, England), VLDB Endowment, 417-425. Google ScholarDigital Library
- QIAN, X. AND WALDINGER, R. 1988. A transaction logic for database specification. In ACM SIGMOD International Conference on Management of Data. ACM, New York, 243-250. Google ScholarDigital Library
- RAMAMRITHAM, K. 1993. Real-time databases. In Distributed and Parallel Databases 1. 199-226. Google ScholarDigital Library
- SCHWIDERSKI, S., HARTMANN, T., AND SAAKE, G. 1994. Monitoring temporal preconditions in a behaviour oriented object model. Data Knou, l. Eng. 14, 143-186. Google ScholarDigital Library
- SISTLA, h. AND WOLFSON, O. 1995. Temporal triggers in active databases. IEEE Trans. Knowl. Data Eng. To appear. Google ScholarDigital Library
- SNODGRASS, R. 1987. The temporal query language TQuel. ACM Trans. Database Syst. 12, 2 (June), 247-298. Google ScholarDigital Library
- SNODGRASS, R. AND AHN, I. 1986. Temporal databases. Computer 19, 9, 35-42. Google ScholarDigital Library
- TANSEL, A., CLIFFORD, J., GADIA, S., JAJODIA, S., SEGEV, A., AND SNODGRASS, R., EDS. 1993. Temporal Databases: Theory, Design, and Implementation. Benjamin-Cummings, Redwood City, Calif. Google ScholarDigital Library
- TOPOR, R. 1987. Domain-independent formulas and databases. Theor. Comput Sct. 52, 281-306. Google ScholarDigital Library
- 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-593Google Scholar
- TUZHmIN, A 1991. Temporal logic as a simulation language. In International Conference on Artificial Intelltgence and Simulatzon.Google Scholar
- TUZHILIN, A. AND CLIFFORD, J. 1990. A temporal relational algebra as a bas~s for temporal relational completeness. In International Conference on Very Large Data Bases. Google ScholarDigital Library
- VAN GELDER, A. AND TOPOR, R. 1991. Safety and translation of relational calculus queries. ACM Trans. Database Syst. 16, 2 (June), 235 278. Google ScholarDigital Library
- 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.Google Scholar
- V^RDI, M.Y. 1992. Personal communication.Google Scholar
- VARDI, M.Y. 1988. A temporal fixpoint calculus In ACM Symposium on Principles of Programmmg Languages (San Diego, Calif.), ACM, New York. Google ScholarDigital Library
- WIDOM, J., COCHRANE, R., AND LINDSA~, B. 1991 hnplementing set-oriented production rules as an extension to Starburst. In International Conference on Very Large Data Bases (Barcelona), VLDB Endowment, 275-285. Google ScholarDigital Library
- WOLPER, P 1983. Temporallogic can be more expressive Inf Control 56, 72-99.Google Scholar
Index Terms
- Efficient checking of temporal integrity constraints using bounded history encoding
Recommendations
Integrity Constraints in Temporal Relational Databases
ITCC '04: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2The article addresses the key issues of integrity constraints intemporal data within the relational framework. These issues includerepresentation of temporal data, temporal grouping identifiers,primary keys of temporal relations and other forms of ...
Implementing Temporal Integrity Constraints Using an Active DBMS
The paper proposes a general architecture for implementing temporal integrity constraints by compiling them into a set of active DBMS rules. The modularity of the design allows easy adaptation to different environments. Both differences in the ...
Persistent Storage of Ontology-Based Data with Integrity Constraints
FCST '10: Proceedings of the 2010 Fifth International Conference on Frontier of Computer Science and TechnologyRecently, a lot of approaches and systems were proposed to store the ontology-based data to the relational database. In this paper, we present a novel approach to store the ontology-based data with integrity constraints. Integrity constraint (IC) is a ...
Reviews
Jaroslav Pokorny
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, generally, the entire database history. To overcome this infeasibility, the author proposes a method that automatically derives the historical information that has to be kept in a database state for the purpose of checking temporal constraints. As a first step to attacking the problem, the restriction of FOTL, called Past FOTL, is introduced (Section 2). The semantics of this language is associated with finite-time temporal databases. In Section 3, the above-mentioned method for temporal constraint evaluation is described. Database states are augmented with new auxiliary relations to form extended states. This encoding of the database history under the given set of constraints is not lossless. This approach does not allow one to deal with general temporal queries here, but the encoding proposed is usually more space-efficient than storing the entire history. Unfortunately, any lossless encoding of the history requires arbitrarily more space. Section 3 explains both how to construct auxiliary relations and how to implement them as materialized views in a conventional RDBMS. Some correctness issues are also discussed here. The author also shows how to deal with temporal triggers in this approach. Section 4 extends FOTL to Past Metric FOTL, a language that is appropriate to the formulation of real-time constraints. Finally, in Section 5, a most general framework is developed. Arbitrary FOTL formulas referring to both past and future are allowed in this framework. Section 6 comprehensively compares all associated approaches. In Section 7, the author draws conclusions and sketches another possible development of his work. The paper is highly readable. All theoretical constructs are completed by highlighting notes and real examples. More complicated issues are presented clearly and in detail. The benefit of the paper is both theoretical and practical. The results may also be interesting for everybody who is implementing a temporal database.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments