Abstract
In this paper, we introduce a new definition of completeness for temporal query languages based on the relational model. Our definition relies on the following three notions: relational completeness of non-temporal queries as defined by Codd; the preservation of temporal irreducibility of temporal (valid time) relations, be they stored or returned as results of temporal queries; and the notion of temporal equivalence between temporal and non-temporal queries. Particularly important is the notion of temporal irreducibility which requires that the valid time intervals of two tuples with the same data values must not touch or overlap, since unreduced relations generate incorrect answers to certain types of temporal queries. Finally, we introduce the query language ChronoLog which is a temporally complete extension of Datalog.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. F. Allen. Maintaining Knowledge about Temporal Intervals. Communications of the ACM, 16(11), 1983.
M. Böhlen and R. Marti. A Temporal Extension of the Deductive Database System Pro-Quel. Technical report, Departement Informatik, ETH Zürich, 1992.
M. Böhlen and R. Marti. Handling Temporal Knowledge in a Deductive Database System. In A. Oberweis W. Stucky, editor, Datenbanksysteme in Büro, Technik und Wissenschaft, 1993.
M. Böhlen. The Temporal Deductive Database System ChronoLog. PhD thesis, Departement Informatik, ETH Zürich, 1994.
J. Burse. Pro-Quel: Using Prolog to Implement a Deductive Database System. Technical report, Departement Informatik, ETH Zürich, 1992.
J. Clifford, A. Croker, and A. Tuzhilin. On the Completeness of Query Languages for Grouped and Ungrouped Historical Data Models. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 496–533. Benjamin/Cummings Publishing Company, 1993.
S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Databases. Surveys in Computer Science, Springer Verlag, Berlin, 1990.
E. F. Codd. Relational Completeness of Data Base Sublanguages. Courant Computer Symposia Series, 6:65–98, 1972.
D. Gabbay. The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, pages 409–448. Springer-Verlag, LNCS 398, 1987.
S. K. Gadia. Weak Temporal Relations. In Proceedings of the International Conference on Principles of Database Systems, 1986.
S. K. Gadia. A Homogeneous Relational Model and Query Languages for Temporal Databases. ACM Transactions on Database Systems, 13(4):418–448, 1988.
S. K. Gadia and C. Yeung. A Generalized Model for a Relational Temporal Database. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1988.
B. Haugh. Non-standard Semantics for the Method of Temporal Arguments. In P. Jackson, editor, Proceedings of the International Joint Conference on Artificial Intelligence, pages 449–455, 1987.
P.M. Hill and R.W. Topor. A Semantics for Typed Logic Programs. In F. Pfenning, editor, Types in Logic Programming, chapter 1, pages 1–62. MIT Press, 1992.
C. Jensen, M. Soo, and R. Snodgrass. Unification of Temporal Data Models. In International Conference on Data Engineering, 1993.
H.F. Korth and A. Silberschatz. Database system concepts. McGraw-Hill, 1991.
J. W. Lloyd. Logic Programming. Symbolic Computation, Springer Verlag, Berlin, 1987.
R. Marti. Research in Deductive Databases at ETH: The LogiQuel Project. In SI-DBTA Proceedings Database Research in Switzerland, pages 130–143, 1991.
L. E. McKenzie and R. T. Snodgrass. Evaluation of Relational Algebras Incorporating the Time Dimension in Databases. ACM Computing Surveys, 23(4):501–543, 1991.
S. Naqvi and S. Tsur. A Logical Language for Data and Knowledge Bases. Computer Science Press, New York, 1989.
H. Reichgelt. A Comparison of First Order and Modal Logics of Time. In P. Jackson and F. van Harmelen H. Reichgelt, editors, Logic-Based Knowledge Representation. MIT Press, 1989.
R. Snodgrass. An Overview of TQuel. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 141–182. Benjamin/Cummings Publishing Company, 1993.
M. Soo. Bibliography on Temporal Databases. SIGMOD RECORD, 20(1):14–23, 1991.
A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass. Temporal Databases: Theory, Design, and Implementation. Benjamin/Cummings Publishing Company, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Böhlen, M., Marti, R. (1994). On the completeness of temporal database query languages. In: Gabbay, D.M., Ohlbach, H.J. (eds) Temporal Logic. ICTL 1994. Lecture Notes in Computer Science, vol 827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013994
Download citation
DOI: https://doi.org/10.1007/BFb0013994
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58241-0
Online ISBN: 978-3-540-48585-8
eBook Packages: Springer Book Archive