By Topic

A logic for handling time in temporal databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Bassiouni, M.A. ; Dept. of Comput. Sci., Central Florida Univ., Orlando, FL, USA

An approach to the handling of time in query languages of historical database management systems is outlined. The approach is based on extending Boolean and comparison operators by allowing their operands to be sets of time intervals. The proposed temporal logic is shown to satisfy the properties of the normal Boolean logic. A relational-calculus query language using the extended logic is proposed. A 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 extension presented in this paper offer a good degree of flexibility in expressing different temporal requirements

Published in:

Computer Software and Applications Conference, 1988. COMPSAC 88. Proceedings., Twelfth International

Date of Conference:

5-7 Oct 1988