About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
APADS 1993
Conference paper
Join query optimization in parallel database systems
Abstract
The authors present a new framework for studying query optimization. They first note that scheduling and optimization must go together in a parallel environment. They introduce the concept of response time envelopes which integrates scheduling and optimization. It is shown that it can be used effectively to develop parallel query optimization algorithms which have same order of complexity as the traditional sequential query optimization algorithms and produce provably optimal or near optimal join plans.