Common Subexpression Processing in Multiple-Query Processing

The efficiency of common subexpression identification is critical to the performance of multiple-query processing. In this paper, we develop a multigraph for representing and facilitating the processing of multiple queries. In addition to the traditional multiple-query processing approaches in exploiting common subexpressions for identical and subsumption cases, the proposed multigraph processing also covers the overlap case. A performance study shows the viability of this technique when compared to an earlier multigraph approach.

[1]  Matthias Jarke,et al.  Common Subexpression Isolation in Multiple Query Optimization , 1984, Query Processing in Database Systems.

[2]  Eugene Wong,et al.  Decomposition—a strategy for query processing , 1976, TODS.

[3]  Patrick A. V. Hall,et al.  Optimization of a Single Relation Expression in a Relational Data Base System , 1976, IBM J. Res. Dev..

[4]  Arie Segev,et al.  Using common subexpressions to optimize multiple queries , 1988, Proceedings. Fourth International Conference on Data Engineering.

[5]  Harry B. Hunt,et al.  Processing Conjunctive Predicates and Queries , 1980, VLDB.

[6]  Sharma Chakravarthy.  Divide and conquer: A basis for augmenting a conventional query optimizer with multiple query-processing capabilities , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[7]  Jack Minker,et al.  Multiple Query Processing in Deductive Databases using Query Graphs , 1986, VLDB.

[8]  Timos K. Sellis,et al.  Multiple-query optimization , 1988, TODS.

[9]  Arnon Rosenthal,et al.  Anatomy of a Mudular Multiple Query Optimizer , 1988, VLDB.

[10]  Sheldon J. Finkelstein.  Common expression analysis in database applications , 1982, SIGMOD '82.

[11]  Goetz Graefe,et al.  Sort-merge-join: an idea whose time has(h) passed? , 1994, Proceedings of 1994 IEEE 10th International Conference on Data Engineering.