A framework for multiple-query optimization

Abstract

Certain computations that may arise repeatedly during the simultaneous processing of multiple queries offer an opportunity for amortizing the processing costs. This paper classifies the types of common computations that can arise, develops methods for exploiting them, and proposes ways for detecting them. It outlines a framework developed for the optimal interleaved processing of multiple queries in relational DBMS.<>