Abstract
Queries over temporal databases involve references to time. We study differences between two approaches of including such references into a first-order query language (e.g., relational calculus): explicit (using typed variables and quantifiers) vs. implicit (using a finite set of modal connectives). We also show that though the latter approach—a first-order query language with implicit references to time—is appealing by its simplicity and ease of use, it cannot express all queries expressible using the first one in general. This result also settles a longstanding open problem about the expressive power of first-order temporal logic. A consequence of this result is that there is no first-order complete query language subquery-closed with respect to a uniform database schema, and thus we cannot use temporal relational algebra over uniform relations to evaluate all first-order definable queries.
Preliminary version of the results has been presented at the Pre-PODS'95 Workshop on Theory of Constraint Databases, TR UNL-CSE-95-08.
Research conducted while this author was at the Dept. of Comp. and Info. Science, Kansas State University, Manhattan, KS 66506, U.S.A.
Supported by Polish KBN grant 2 P301 009 06.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Herr, L., Van den Bussche, J. Temporal Connectives versus Explicit Timestamps in Temporal Query Languages. (unpublished manuscript).
Chomicki J. Temporal Query Languages: a Survey. Proc. International Conference on Temporal Logic, July 1994, Bonn, Germany, Springer-Verlag (LNAI 827), pp. 506–534.
Chomicki J. Efficient Checking of Temporal Integrity Constraints Using Bounded History Encoding. In ACM Transactions on Database Systems, (20) 2, pp. 149–186. 1995.
Chomicki, J., Niwinski, D. On the Feasibility of Checking Temporal Integrity Constraints. Proc. 12th ACM Symposium on Principles of Database Systems, pp 202–213, 1993. (full version to appear in JCSS).
Chomicki, J., Toman, D. Implementing Temporal Integrity Constraints Using an Active DBMS. IEEE Transactions on Knowledge and Data Engineering, Special section on Temporal and Real-time Databases, Vol. 7, No. 4, 1995.
Clifford J., Croker A. The Historical Relational Data Model (HRDM) and Algebra based on Lifespans. In Proceedings of the International Conference on Data Engineering, pages 528–537, Los Angeles, CA, February 1987.
Clifford J., Croker A., Tuzhilin A. On Completeness of Historical Relational Query Languages. ACM Transactions on Database Systems, Vol. 19, No. 1, pp. 64–116, 1994.
Ehrenfeucht, A. An application of games to the completeness problem for formalized theories. Fund. Math., 49:129–141, 1961.
Fraisse, R. Sur les classifications des systemes de relations. Publ. Sci. Univ. Alger, 1:1, 1954.
Gabbay D. Expressive Functional Completeness in Tense Logic. In Mönnich U. Aspects of Philosophical Logic, 91–117, 1981.
Gabbay D. The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems. In Banieqbal B., et al. (ed.) Temporal Logic in Specification, vol. 398, pp. 409–448, Springer Verlag, LNCS 398, 1989.
Gabbay D., Pnueli A., Shelah S., Stavi J. On the Temporal Analysis of Fairness. Proc. ACM Symposium on Principles of Programming Languages, 1980.
Gabbay D., Hodkinson I., Reynolds M. Temporal Logic. Mathematical Foundations and Computational Aspects. Vol. 1. Oxford Logic Guides 28, Oxford Science Publications, 1994.
Immerman N., Kozen D. Definability with Bounded Number of Variables. Information and Computation 83, pp. 121–139, 1989.
Kamp J.A.W. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, 1968.
Kamp J.A.W. On the Formal Properties of ‘now'. Theoria 37:227–273, 1971.
Lipeck U.W., Saake, G. Monitoring Dynamic Integrity Constraints Based on Temporal Logic. Information Systems, 12(2):255–269, 1987.
Rosenstein J.G. Linear Orderings. Academic Press, New York, 1982.
Snodgrass R. T. The Temporal Query Language TQuel. ACM Transactions on Database Systems, 12(2):247–298, June 1987.
Snodgrass R.T., editor. The TSQL2 Temporal Query Language. Kluwer Academic Publishers, 674+xxiv pages, 1995.
Tansel A., Clifford J., Gadia S., Jajodia S., Segev A., Snodgrass R. Temporal Databases. Theory, Design, and Implementation. Benjamin Cummings 1993.
Stavi J. Functional Completeness over Rationals. Unpublished, Bar-Ilan University, Ramat-Gan, Israel, 1979.
Tuzhilin A., Clifford J. A Temporal Relational Algebra as a Basis for Temporal Completeness. Proc. International Conference on VLDB, 1990.
Ullman J. D. Principles of Database and Knowledge-base Systems, Vol. 1,2. Computer Science Systems, 1989.
Vardi M.Y. A Temporal Fixpoint Calculus. In ACM Symposium on Principles of Programming Languages, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Toman, D., Niwiński, D. (1996). First-order queries over temporal databases inexpressible in temporal logic. In: Apers, P., Bouzeghoub, M., Gardarin, G. (eds) Advances in Database Technology — EDBT '96. EDBT 1996. Lecture Notes in Computer Science, vol 1057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014160
Download citation
DOI: https://doi.org/10.1007/BFb0014160
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61057-1
Online ISBN: 978-3-540-49943-5
eBook Packages: Springer Book Archive