Title
Identifying robust plans through plan diagram reduction
Abstract
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices and inflated response times. In this paper, we investigate mitigating this problem by replacing selectivity error-sensitive plan choices with alternative plans that provide robust performance. Our approach is based on the recent observation that even the complex and dense "plan diagrams" associated with industrial-strength optimizers can be efficiently reduced to "anorexic" equivalents featuring only a few plans, without materially impacting query processing quality. Extensive experimentation with a rich set of TPC-H and TPC-DS-based query templates in a variety of database environments indicate that plan diagram reduction typically retains plans that are substantially resistant to selectivity errors on the base relations. However, it can sometimes also be severely counter-productive, with the replacements performing much worse. We address this problem through a generalized mathematical characterization of plan cost behavior over the parameter space, which lends itself to efficient criteria of when it is safe to reduce. Our strategies are fully non-invasive and have been implemented in the Picasso optimizer visualization tool.
Year
DOI
Venue
2008
10.14778/1453856.1453976
PVLDB
Keywords
Field
DocType
alternative plan,poor plan choice,robust plan,query processing quality,query execution,database query,selectivity error-sensitive plan choice,plan cost behavior,tpc-ds-based query template,plan diagram,plan diagram reduction,parameter space
Query optimization,Data mining,Database query,Visualization,Computer science,Diagram,Supercomputer Education Research Centre,Database
Journal
Volume
Issue
ISSN
1
1
2150-8097
Citations 
PageRank 
References 
23
0.77
21
Authors
3
Name
Order
Citations
PageRank
Harish Doraiswamy125218.95
Pooja N. Darera2351.51
Jayant R. Haritsa32004228.38