A Unisorted Algebra for Historical Relations with Interval-Stamped Tuples

From Tetherless World Wiki

Jump to: navigation, search

Citation: Amar K. Das. (1993) A Unisorted Algebra for Historical Relations with Interval-Stamped Tuples. In KSL-93-44, June,1993.

Publication techreport ( Edit )
type Technical Report
bibtype techreport
Bibtex basics
author Amar K. Das
title A Unisorted Algebra for Historical Relations with Interval-Stamped Tuples
number KSL-93-44
institution Knowledge Systems, AI Laboratory
address Stanford, CA, USA
year 1993
month June
Bibtex more
Access Paper
abstract Research on temporal relational databases can be classified into two categories by the type of time-stamping method used: tuple time stamping and attribute-value time stamping. Although the former method of time stamping retains the simple structure of the relational model, standard relational operators do not form either a closed or a complete algebra for manipulating such temporal objects. In this paper, we provide a proper algebra for historical relations with interval-stamped tuples. To formalize the representations of and operations on time, we first develop a general model of time that includes a set of operations on chronons and intervals. We then define the temporal semantics of a unisorted algebra that is closed for historical relations. We ensure that our algebraic operators can support historical queries by requiring the algebra to support all operations in the time model. In contrast to time stamping of attribute values, time stamping of tuples uses the classical normalized relation that is supported by most relational database technologies. We discuss briefly how we implement the operations in our algebra in such a database with a temporal query processor for SQL.

KSL Technical Report ID: KSL-93-44
Facts about A Unisorted Algebra for Historical Relations with Interval-Stamped TuplesRDF feed
Abstract Research on temporal relational databases … Research on temporal relational databases can be classified into two categories by the type of time-stamping method used: tuple time stamping and attribute-value time stamping. Although the former method of time stamping retains the simple structure of the relational model, standard relational operators do not form either a closed or a complete algebra for manipulating such temporal objects. In this paper, we provide a proper algebra for historical relations with interval-stamped tuples. To formalize the representations of and operations on time, we first develop a general model of time that includes a set of operations on chronons and intervals. We then define the temporal semantics of a unisorted algebra that is closed for historical relations. We ensure that our algebraic operators can support historical queries by requiring the algebra to support all operations in the time model. In contrast to time stamping of attribute values, time stamping of tuples uses the classical normalized relation that is supported by most relational database technologies. We discuss briefly how we implement the operations in our algebra in such a database with a temporal query processor for SQL. e with a temporal query processor for SQL.
Address Stanford, CA, USA  +
Author Amar K. Das  +
Bibtype techreport  +
Has author Amar K. Das  +
Has identifier KSL-93-44  +
Has publishing details June,1993  +
Has title A Unisorted Algebra for Historical Relations with Interval-Stamped Tuples  +
Has where published KSL-93-44  +
Has year 1993  +
Institution Knowledge Systems, AI Laboratory  +
Ksl tr id KSL-93-44  +
Month June  +
Number KSL-93-44  +
Process note NO  +
Title A Unisorted Algebra for Historical Relations with Interval-Stamped Tuples  +
Year 1993  +
Retrieved from "http://tw.rpi.edu/wiki/A_Unisorted_Algebra_for_Historical_Relations_with_Interval-Stamped_Tuples"
Personal tools