Abstract
An expression applying to a relational database is optimized by mapping the expression upon set expressions which, in turn, are transformed into logical expressions. These logical expressions then are optimized, taking into account the constraints that are inherent in relational expressions and the costs of those expressions. Subsequently a reverse transformation to relational expressions is applied. The method is developed for the traditional relational operators and is applicable to a variety of cost criteria. Common subexpressions as well as redundant expressions are optimized. A new relational operation “split” is proposed that may be used effectively in an optimized expression. Results obtained with a model for the optimization method are presented.
Sign-in/Register to access full text options 
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
