A recursive temporal algebra and temporal completeness

Mehmet A. Orgun

doi:10.1109/TIME.1996.555687

A recursive temporal algebra and temporal completeness

Mehmet A. Orgun

Department of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

4 Citations (Scopus)

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	https://doi.org/10.1109/TIME.1996.555687
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	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

Access to Document

10.1109/TIME.1996.555687

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

Cite this

@inproceedings{a67417ae163244859731bf0269c32fcb,

title = "A recursive temporal algebra and temporal completeness",

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.",

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",

author = "Orgun, {Mehmet A.}",

year = "1996",

month = may,

day = "1",

doi = "10.1109/TIME.1996.555687",

language = "English",

isbn = "0818675284",

pages = "96--103",

booktitle = "Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "1996 3rd International Workshop on Temporal Representation and Reasoning (TIME '96) ; Conference date: 19-05-1996 Through 20-05-1996",

}

Orgun, MA 1996, A recursive temporal algebra and temporal completeness. in Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96). Institute of Electrical and Electronics Engineers (IEEE), pp. 96-103, 1996 3rd International Workshop on Temporal Representation and Reasoning (TIME '96), Key West, United States, 19/05/96. https://doi.org/10.1109/TIME.1996.555687

TY - GEN

T1 - A recursive temporal algebra and temporal completeness

AU - Orgun, Mehmet A.

PY - 1996/5/1

Y1 - 1996/5/1

N2 - 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.

AB - 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.

KW - relational algebra

KW - recursive temporal algebra

KW - temporal completeness

KW - time-varying data

KW - temporal relational data model

KW - temporal database

KW - linear recursion

KW - temporal algebras

KW - Algebra

KW - Relational databases

KW - Equations

KW - Data models

KW - Aggregates

KW - Time varying systems

KW - Database languages

U2 - 10.1109/TIME.1996.555687

DO - 10.1109/TIME.1996.555687

M3 - Conference proceeding contribution

SN - 0818675284

SP - 96

EP - 103

BT - Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)

PB - Institute of Electrical and Electronics Engineers (IEEE)

T2 - 1996 3rd International Workshop on Temporal Representation and Reasoning (TIME '96)

Y2 - 19 May 1996 through 20 May 1996

ER -