Loading...
Please wait, while we are loading the content...
Similar Documents
Rapid Bushy Join-order Optimization with Cartesian Products (1996)
| Content Provider | CiteSeerX |
|---|---|
| Author | Vance, Bennet Maier, David |
| Description | In Proc. of the ACM SIGMOD Conf. on Management of Data |
| Abstract | Query optimizers often limit the search space for join orderings, for example by excluding Cartesian products in subplans or requiring at least one input of each join to be a stored relation. Such exclusions are widely assumed to reduce optimization effort while minimally affecting plan quality. However, we show that searching the complete space of plans is more affordable than has been previously recognized, and that the common exclusions may be of little benefit. We start by presenting a Cartesian product optimizer that easily searches the space of bushy plans for 15-way Cartesian products in a matter of seconds on high-performance workstations. By building on this optimizer we then obtain a join-order optimizer that achieves a similar level of performance, and retains the ability to include Cartesian products in subplans wherever appropriate. The main contribution of the paper is in fully separating join-order enumeration from predicate analysis, and in showing that the former probl... |
| File Format | |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Former Probl Plan Quality Join-order Optimizer Little Benefit Common Exclusion Predicate Analysis Optimization Effort Similar Level Rapid Bushy Join-order Optimization Join-order Enumeration Stored Relation High-performance Workstation Bushy Plan Query Optimizers Search Space Cartesian Product Join Ordering Complete Space 15-way Cartesian Product Cartesian Product Optimizer |
| Content Type | Text |
