Title

Handling Time In Query Languages

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Lect. Notes Comput. Sci.

Keywords

Computer Science; Theory & Methods

Abstract

In this paper, an approach to handle time in relational query languages is outlined. The approach is based on extending Boolean and comparison operators by allowing their operands to be sets of intervals [BASS87]. The proposed temporal logic is shown to satisfy the properties of the normal Boolean logic. New syntax for retrieval statements is defined in order to separate the process of selecting entities (tuples) and the process of selecting required values of temporal attributes from the chosen entities. The extensions presented in this paper offer a good degree of flexibility in expressing different temporal requirements.

Journal Title

Lecture Notes in Computer Science

Volume

339

Publication Date

1-1-1989

Document Type

Article

Language

English

First Page

105

Last Page

119

WOS Identifier

WOS:A1989T986600007

ISSN

0302-9743

Share

COinS