Journal of Logic and Computation Advance Access originally published online on October 20, 2008
Journal of Logic and Computation 2009 19(2):369-404; doi:10.1093/logcom/exn056
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Original Articles |
Fixpoint and While Temporal Query Languages
Univ. Paris-Sud, UMR 8623 and CNRS, Orsay F-91405, France.
E-mail: nicole.bidoit{at}lri.fr
Received 3 October 2007.
| Abstract |
|---|
The article investigates the expressive power of implicit temporal query languages. These languages are designed while assuming temporal data modelled as sequences of data. So far, two styles of implicit temporal query languages are known: T-WHILE like languages are based on a temporal extension of WHILE with left and right moves; µTL like languages are a fixpoint extension of TL. This article focusses on comparing the expressive power of T-WHILE style languages and µTL languages and provides complementary results with respect to Abiteboul et al. (1999, J. Comput. System Sci.,58, 54–68). The main contribution is the proof of the equivalence of the three following temporal languages: the non-inflationary variant of µTL, the language T-WHILE and more surprisingly the language T-FIXPOINT.
Keywords: Database; temporal databases; temporal logic; query language; fixpoint query; while query