Plan Selection Based on Query Clustering

Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize the optimization cost. Our scheme groups similar queries into clusters and uses the optimizer-generated plan for the cluster representative to execute all future queries assigned to the cluster. Query similarity is evaluated based on a comparison of query structures and the associated table schemas and statistics, and a classifier is employed for efficient cluster assignments. Experiments with a variety of queries on a commercial optimizer show that PLASTIC predicts the correct plan choice in most cases, thereby providing significantly improved query optimization times. Further, when errors are made, the additional execution cost incurred due to the sub-optimal plan choices is marginal.

• Type: Journal
• Year: 2002
• Where: VLDB
• Authors: Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, Jayant R. Haritsa
• Keywords: Database, Plan Choices, Query Optimization, Query Optimizers, VLDB 2002