Sengar, Vibhuti S and Haritsa, Jayant R (2003) PLASTIC: Reducing Query Optimization Overheads through Plan Recycling. In: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, June 2003, San Diego, California ,USA, 676 -676.
Query optimization is a computationally intensive process, especially for the complex queries that are typical in current data warehousing and mining applications. The inherent overheads of query optimization are compounded by the fact that a new query is typically optimized afresh, providing no opportunity to amortize these overheads over prior optimizations. While current commercial query optimizers do provide facilities for reusing execution plans generated for earlier queries (e.g. "stored outlines" in Oracle 9i), the query matching is extremely restrictive-only if the incoming query has a close textual resemblance with one of the stored queries is the associated plan re-used to execute the new query.
|Item Type:||Conference Paper|
|Additional Information:||©ACM,2003.This is the author's version of the work.It is posted here by permission of ACM for your personal use.Not for redistribution.The definitive version was published in Proceedings of the 2003 ACM SIGMOD international conference on Management of data.|
|Keywords:||plastic prototype;query optimization;plan recycling|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||25 Aug 2008|
|Last Modified:||19 Sep 2010 04:14|
Actions (login required)