Handling Time In Query Languages
Abbreviated Journal Title
Lect. Notes Comput. Sci.
Computer Science; Theory & Methods
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.
Lecture Notes in Computer Science
Bassiouni, M. A. and Llewellyn, M., "Handling Time In Query Languages" (1989). Faculty Bibliography 1980s. 746.