Temporal Connectives Versus Explicit Timestamps to Query Temporal Databases

Temporal databases can be queried either by query languages working directly on a timestamp representation or by languages using an implicit access to time via temporal connectives. We study the differences in expressive power between these two approaches. First, we consider temporal and first-order logic. We show that future temporal logic is strictly less powerful than past?future temporal logic and also that there are queries expressible in first-order logic with explicit timestamps that are not expressible in extended temporal logic. Our proof technique is novel and based on communication complexity. Then, we consider extensions of first-order logic with fixpoints or while-loops. Again the explicit temporal version of these languages, using timestamps, is compared with an implicit one, using instructions for moving in time. We also compare the temporal versions of the fixpoint language with those of the while language.

[1]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[2]  Jan,et al.  Finite Representation of In nite Query Answers , 1992 .

[3]  Marianne Baudinet,et al.  Temporal Deductive Databases [chap. 13] , 1993 .

[4]  Moshe Y. Vardi.  A temporal fixpoint calculus , 1988, POPL '88.

[5]  Sushil Jajodia,et al.  Temporal Databases: Theory, Design, and Implementation , 1993 .

[6]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[7]  David Toman,et al.  First-Order Queries over Temporal Databases Inexpressible in Temporal Logic , 1996, EDBT.

[8]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[9]  Pierre Wolper.  Temporal Logic Can Be More Expressive , 1983, Inf. Control..

[10]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[11]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[12]  D. Peled,et al.  Temporal Logic: Mathematical Foundations and Computational Aspects, Volume 1 , 1995 .

[13]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[14]  Jan Chomicki,et al.  Temporal Query Languages: A Survey , 1994, ICTL.

[15]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[16]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.

[17]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[18]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[19]  Serge Abiteboul,et al.  Computing with First-Order Logic , 1995, J. Comput. Syst. Sci..

[20]  Marianne Baudinet,et al.  Temporal Deductive Databases , 1993, Temporal Databases.

[21]  James Clifford,et al.  A Temporal Relational Algebra as a Basis for Temporal Relational Completeness , 1990 .

[22]  Serge Abiteboul,et al.  Fundamental Properties of Deterministic and Nondeterministic Extensions of Datalog , 1991, Theor. Comput. Sci..

[23]  Jan Chomicki,et al.  Finite representation of infinite query answers , 1993, TODS.

[24]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[25]  Peter Øhrstrøm,et al.  Temporal Logic , 1994, Lecture Notes in Computer Science.