Dynamic query re-optimization

Very long running queries in database systems are not uncommon in non traditional application domains such as image processing or data warehousing analysis. Query optimization, therefore, is important. However, estimates of the query characteristics before query execution are usually inaccurate. Further, system configuration and resource availability may change during long evaluation period. As a result, queries are often evaluated with sub-optimal plan configurations. To remedy this situation, we have designed a novel approach to re-optimize suboptimal query plan configurations on-the-fly with Conquest, an extensible and distributed query processing system. A dynamic optimizer considers reconfiguration cost as well as execution cost in determining the best query plan configuration. Experimental results are presented.

[1]  Goetz Graefe,et al.  Extensible Query Optimization and Parallel Execution in Volcano , 1991, Query Processing for Advanced Database Systems.

[2]  Miron Livny,et al.  The Case for Enhanced Abstract Data Types , 1997, VLDB.

[3]  Bernhard Mitschang,et al.  On parallel processing of aggregate and scalar functions in object-relational DBMS , 1998, SIGMOD '98.

[4]  Karen Ward,et al.  Dynamic query evaluation plans , 1989, SIGMOD '89.

[5]  Hongjun Lu,et al.  The Fittest Survives: An Adaptive Approach to Query Optimization , 1995, VLDB.

[6]  David J. DeWitt,et al.  Efficient mid-query re-optimization of sub-optimal query execution plans , 1998, SIGMOD '98.

[7]  Goetz Graefe,et al.  Optimization of dynamic query evaluation plans , 1994, SIGMOD '94.

[8]  Richard R. Muntz,et al.  On reconfiguring query execution plans in distributed object-relational DBMS , 1998, Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250).

[9]  Praveen Seshadri,et al.  PREDATOR: an OR-DBMS with enhanced data types , 1997, SIGMOD '97.

[10]  Richard R. Muntz,et al.  Scalable Exploratory Data Mining of Distributed Geoscientific Data , 1996, KDD.

[11]  Michael Stonebraker,et al.  Object-Relational DBMSs, Second Edition , 1998 .

[12]  Nick Roussopoulos,et al.  Adaptive selectivity estimation using query feedback , 1994, SIGMOD '94.

[13]  Laurent Amsaleg,et al.  Cost-based query scrambling for initial delays , 1998, SIGMOD '98.

[14]  Hamid Pirahesh,et al.  Starburst Mid-Flight: As the Dust Clears , 1990, IEEE Trans. Knowl. Data Eng..

[15]  Kenneth Salem,et al.  A Language for Manipulating Arrays , 1997, VLDB.

[16]  Jennifer Widom,et al.  Active Database Systems , 1995, Modern Database Systems.

[17]  Jeffrey F. Naughton,et al.  Query execution techniques for caching expensive methods , 1996, SIGMOD '96.

[18]  Michael Stonebraker,et al.  Predicate migration: optimizing queries with expensive predicates , 1992, SIGMOD Conference.

[19]  G. Antoshenkov,et al.  Dynamic query optimization in Rdb/VMS , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[20]  Goetz Graefe,et al.  The Volcano optimizer generator: extensibility and efficient search , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[21]  PlansKenneth,et al.  Dynamic Recon guration of Sub-Optimal Parallel QueryExecution , 1998 .