Lecture Notes in Computer Science, 1998, Volume 1399/1998, 129-149, DOI: 10.1007/BFb0053701

Expressive power of temporal relational query languages and temporal completeness

Abdullah Uz Tansel and Erkan Tin

View Related Documents

Abstract

In this paper, we consider the representation of temporal data based on tuple and attribute timestamping. We identify the requirements of temporal data and elaborate on their implications. We introduce a temporal relational data model where N1NF relations with 1-level of nesting are used. This model uses attribute timestamping. For this model, nested relational tuple calculus (TRC) and equivalent temporal relational algebra (TRA) are defined. We follow a comparative approach towards completeness of temporal query languages. In this direction, we use TRC as a metric and identify common temporal operations.
Material in Sections 2–4, except the proof of Proposition 3, and Section 5 appeared in the references [17] and [20], respectively.

Fulltext Preview

Image of the first page of the fulltext document