A recursive temporal algebra and temporal completeness

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

4 Citations (Scopus)


This paper introduces a recursive temporal algebra based on temporal semantics for querying time-varying data. The algebra, called /spl Rfr/*, is based on a temporal relational data model in which a temporal database is modeled as a collection of time-varying relations. Each time-varying relation is a collection of ordinary relations indexed by moments in time. In /spl Rfr/*, recursive queries (such as the transitive closure of a given relation) can be formulated through equations. It is shown that other forms of recursion, such as linear recursion, can also be expressed using iteration through time. Temporal completeness of /spl Rfr/* is established, with respect to two other temporal algebras based on temporal semantics which offer linear recursive operators.
Original languageEnglish
Title of host publicationProceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages8
ISBN (Print)0818675284
Publication statusPublished - 1 May 1996
Event1996 3rd International Workshop on Temporal Representation and Reasoning (TIME '96) - Key West, United States
Duration: 19 May 199620 May 1996


Conference1996 3rd International Workshop on Temporal Representation and Reasoning (TIME '96)
Country/TerritoryUnited States
CityKey West


  • relational algebra
  • recursive temporal algebra
  • temporal completeness
  • time-varying data
  • temporal relational data model
  • temporal database
  • linear recursion
  • temporal algebras
  • Algebra
  • Relational databases
  • Equations
  • Data models
  • Aggregates
  • Time varying systems
  • Database languages


Dive into the research topics of 'A recursive temporal algebra and temporal completeness'. Together they form a unique fingerprint.

Cite this