A comparison of historical relational query languages

Files

bilkent-research-paper.pdf (68.58 KB)

Date

1994-07

Authors

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

The Second Biennial European Joint Conference on Engineering Systems Design and Analysis,1994

Print ISSN

Electronic ISSN

Publisher

ASME

Volume

Issue

Pages

275 - 282

Language

English

Type

Conference Paper

Journal Title

Journal ISSN

Volume Title

Series

Abstract

We introduce a historical relational data model in which N1NF relations are used and 1-level of nesting is allowed. Attributes can either be atomic or temporal atom. An atomic attribute represents a time invariant attribute. A temporal atom consists of two components, a value and a temporal set, which is a set of times denoting the validity period of the value. We define a relational tuple calculus for this model. We follow a comparative approach towards completeness of historical query languages.

Course

Other identifiers

Book Title

Keywords

Computational complexity , Data structures , Relational database systems , Historical database (HDB) , Relational query languages , Query languages

Citation

Permalink

http://hdl.handle.net/11693/27790

item.page.isversionof

Collections

Department of Computer Engineering