Design and Implementation of Extended Boolean and Comparison Operators for Time-Oriented Query Languages | Zendy

M.A. Bassiouni | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Design and Implementation of Extended Boolean and Comparison Operators for Time-Oriented Query Languages

Author(s) -

M.A. Bassiouni

Publication year - 1994

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/37.7.576

Subject(s) - operand , computer science , flexibility (engineering) , boolean expression , theoretical computer science , query language , query optimization , programming language , boolean function , algorithm , data mining , mathematics , statistics , operating system

Standard Boolean and comparison operators are based on the True/False logic and are therefore not quite suitable for handling events/activities defined over periods of time. In this paper, we generalize the Boolean and comparison operators by allowing their input and output operands to be sets of time intervals. Efficient algorithms for the implementation of the extended operators are presented. The generalized operators can be used to enhance the user interface of time-oriented query languages and allow application users to express their time-related qualifications more succinctly and elegantly. The paper is concluded by examples showing the flexibility of the extended operators in expressing time- related requirements

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research