A complete temporal relational algebra

  • Authors:

  • Debabrata Dey;Terence M. Barron;Veda C. Storey

  • Affiliations:

  • Department of Information Systems and Decision Sciences, College of Business Administration, Louisiana State University, Baton Rouge, LA 70803, USA/ e-mail: qmdey@lsuvm.sncc.lsu.edu;Department of Information Systems and Operation Management, College of Business Administration, University of Toledo, Toledo, OH 43606, USA/ e-mail: tbarron@utnet.utoledo.edu;William E. Simon Graduate School of Business Administration, University of Rochester, Rochester, NY 14627, USA/ e-mail: storey@ssbibm.ssb.rochester.edu

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

Various temporal extensions to the relational model have been proposed. All of these, however, deviate significantly from the original relational model. This paper presents a temporal extension of the relational algebra that is not significantly different from the original relational model, yet is at least as expressive as any of the previous approaches. This algebra employs multidimensional tuple time-stamping to capture the complete temporal behavior of data. The basic relational operations are redefined as consistent extensions of the existing operations in a manner that preserves the basic algebraic equivalences of the snapshot (i.e., conventional static) algebra. A new operation, namely temporal projection, is introduced. The complete update semantics are formally specified and aggregate functions are defined. The algebra is closed, and reduces to the snapshot algebra. It is also shown to be at least as expressive as the calculus-based temporal query language TQuel. In order to assess the algebra, it is evaluated using a set of twenty-six criteria proposed in the literature, and compared to existing temporal relational algebras. The proposed algebra appears to satisfy more criteria than any other existing algebra.