Abstract
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 language | English |
---|---|
Title of host publication | Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 96-103 |
Number of pages | 8 |
ISBN (Print) | 0818675284 |
DOIs | |
Publication status | Published - 1 May 1996 |
Event | 1996 3rd International Workshop on Temporal Representation and Reasoning (TIME '96) - Key West, United States Duration: 19 May 1996 → 20 May 1996 |
Conference
Conference | 1996 3rd International Workshop on Temporal Representation and Reasoning (TIME '96) |
---|---|
Country/Territory | United States |
City | Key West |
Period | 19/05/96 → 20/05/96 |
Keywords
- 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