This paper studies query processing techniques for correlated queries, and generalized these techniques to address a variety of related query processing problems. We analyze the traditional technique of Nested Iteration and show how its performance can be improved. We then describe the Magic Decorrelation rewrite technique, demonstrating that several existing decorrelation algorithms are special cases of Magic Decorrelation. Further, we show that Nested Iteration and Magic Decorrelation are two ends of a continuous range of evaluation policies for correlated queries.
By: Praveen Seshadri, Hamid Pirahesh, T. Y. Cliff Leung
Published in: RJ10129 in 1998
This Research Report is not available electronically. Please request a copy from the contact listed below. IBM employees should contact ITIRC for a copy.
Questions about this service can be mailed to reports@us.ibm.com .