(Enter summary)
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... (Update)
Cited by: More
Efficient Dynamic Programming Algorithms for Ordering.. - Scheufele, Moerkotte (1997)
(Correct)
Structural Join Order Selection for XML Query Optimization - Yuqing Wu Yuwu (2003)
(Correct)
Index Structures for Databases Containing Data Items with.. - Helmer (1997)
(Correct)
Similar documents (at the sentence level):
53.7%: Rapid Bushy Join-order Optimization with Cartesian Products - Bennet Vance (1996)
(Correct)
Active bibliography (related documents): More All
0.1: Parallel Query Optimization: Exploiting Bushy and.. - Stillger.. (1996)
(Correct)
0.1: Distributed Query Scheduling Service: An Architecture and.. - Liu, Pu, Richine (1998)
(Correct)
0.1: Query Optimization - Ioannidis (1996)
(Correct)
Similar documents based on text: More All
0.3: Design and Implementation of Algorithms for Star Query.. - Chakrabarti (2000)
(Correct)
0.2: Exploiting Upper and Lower Bounds in Top-Down Query.. - Shapiro, Maier.. (2001)
(Correct)
0.2: An Efficient Framework for Order Optimization - Neumann, Moerkotte (2003)
(Correct)
Related documents from co-citation: More All
18: Access path selection in a relational database management system (context) - Selinger, Astrahan et al. - 1979
16: Measuring the complexity of join enumeration in query optimization (context) - Ono, Lohman - 1990
12: Randomized Algorithms for Optimizing large join queries (context) - Ioannidis, Kang - 1990
BibTeX entry: (Update)
B. Vance and D. Maier. Rapid Bushy Join-order Optimization with Cartesian Products. In Proceedings of the ACM SIGMOD International Conference of Managment of Data, Montreal, Canada, June 1996. http://citeseer.ist.psu.edu/vance96rapid.html More
@inproceedings{ vance96rapid,
author = "Bennet Vance and David Maier",
title = "Rapid bushy join-order optimization with {Cartesian} products",
pages = "35--46",
year = "1996",
url = "citeseer.ist.psu.edu/vance96rapid.html" }
Citations (may not include all citations):
389
Access path selection in a relational database management sy.. (context) - Selinger, Astrahan et al. - 1979
223
The Art of Computer Programming (context) - Knuth - 1973
104
The Volcano optimizer generator: Extensibility and efficient..
- Graefe, McKenna - 1993
88
Predicate migration: Optimizing queries with expensive predi..
- Hellerstein, Stonebraker - 1993
64
Measuring the complexity of join enumeration in query optimi.. (context) - Ono, Lohman - 1990
54
Combining simulated annealing with local search heuristics
- Martin, Otto - 1995
51
bushy trees: An analysis of strategy spaces and its implicat.. (context) - Ioannidis, Kang et al. - 1991
24
the optimal nesting order for computing N-relational joins (context) - Ibaraki, Kameda - 1984
24
randomized join-order selection ---why use transformations (context) - Galindo-Legaria, Pellenkoft et al. - 1994
12
Optimizing join orders
- Steinbrunn, Moerkotte et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.brown.edu/courses/cs227/readinglist.html): More
A Query Language and Optimization Techniques for.. - Buneman, Davidson.. (1996)
(Correct)
The Object-Oriented Database System Manifesto - Atkinson, Bancilhon, DeWitt.. (1989)
(Correct)
Rule Languages and Internal Algebras for Rule-Based Optimizers - Cherniack, Zdonik (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC