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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.