CSDL Home IEEE Transactions on Knowledge & Data Engineering 1997 vol.9 Issue No.01 - January-February
Issue No.01 - January-February (1997 vol.9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.567055
<p><b>Abstract</b>—We consider the representation of temporal data based on tuple and attribute timestamping. We identify the requirements in modeling temporal data and elaborate on their implications in the expressive power of temporal query languages. We introduce a temporal relational data model where N1NF relations and attribute timestamping are used and one level of nesting is allowed. For this model, a nested relational tuple calculus (NTC) is defined. We follow a comparative approach in evaluating the expressive power of temporal query languages, using NTC as a metric and comparing it with the existing temporal query languages. We prove that NTC subsumes the expressive power of these query languages. We also demonstrate how various temporal relational models can be obtained from our temporal relations by NTC and give equivalent NTC expressions for their languages. Furthermore, we show the equivalence of intervals and temporal elements (sets) as timestamps in our model.</p>
Attribute timestamping, expressive power of temporal query languages, N1NF relations, temporal relational algebra, temporal relational calculus, temporal relational completeness, temporal relations, tuple timestamping.
Abdullah Uz Tansel, Erkan Tin, "The Expressive Power of Temporal Relational Query Languages", IEEE Transactions on Knowledge & Data Engineering, vol.9, no. 1, pp. 120-134, January-February 1997, doi:10.1109/69.567055