• DocumentCode
    1805325
  • Title

    A recursive temporal algebra and temporal completeness

  • Author

    Orgun, Mehmet A.

  • Author_Institution
    Dept. of Comput., Macquarie Univ., Sydney, NSW, Australia
  • fYear
    1996
  • fDate
    19-20 May 1996
  • Firstpage
    96
  • Lastpage
    103
  • Abstract
    This paper introduces a recursive temporal algebra based on temporal semantics for querying time-varying data. The algebra, called ℜ*, 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 ℜ*, 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 ℜ* is established, with respect to two other temporal algebras based on temporal semantics which offer linear recursive operators
  • Keywords
    recursive functions; relational algebra; temporal databases; linear recursion; recursive temporal algebra; temporal algebras; temporal completeness; temporal database; temporal relational data model; time-varying data; Aggregates; Algebra; Data models; Database languages; Equations; Relational databases; Time varying systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Temporal Representation and Reasoning, 1996. (TIME '96), Proceedings., Third International Workshop on
  • Conference_Location
    Key West, FL
  • Print_ISBN
    0-8186-7528-4
  • Type

    conf

  • DOI
    10.1109/TIME.1996.555687
  • Filename
    555687