Rapid Bushy Join-order Optimization with Cartesian Products

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 25, Issue 2, 1996, Pages 35-46

  Vance, Bennet ^a   Maier, David ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; OPTIMIZATION;

BENCHMARKING; CARTESIAN PRODUCTS; JOIN ORDER OPTIMIZATION;

RELATIONAL DATABASE SYSTEMS;

EID: 0030156988     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/235968.233317     Document Type: Article

References (12)

1. Sophie Cluet and Guido Moerkotte. On the complexity of generating optimal left-deep processing trees with cross products. In Proceedings of the 5th International Conference on Database Theory, volume 893 of Lecture Notes in Computer Science, pages 54-67, Prague, Czech Republic, January 1995. Springer-Verlag.
2. César Galindo-Legaria, Arjan Pellenkoft, and Martin Kersten. Fast, randomized join-order selection - why use transformations? In Proceedings of the 20th International Conference on Very Large Data Bases, pages 85-95, Santiago, Chile, September 1994. Morgan Kaufmann.
3. Goetz Graefe and William J. McKenna. The Volcano optimizer generator: Extensibility and efficient search. In Proceedings of the IEEE Conference on Data Engineering, pages 209-218, Vienna, Austria, April 1993.
4. Joseph M. Hellerstein and Michael Stonebraker. Predicate migration: Optimizing queries with expensive predicates. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 267-276, Washington, DC, May 1993.
5. Toshihide Ibaraki and Tiko Kameda. On the optimal nesting order for computing N-relational joins. ACM Transactions on Database Systems, 9(3):482-502, September 1984.
6. Yannis E. Ioannidis and Younkyung Cha Kang. Left-deep vs. bushy trees: An analysis of strategy spaces and its implications for query optimization. In Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data, pages 168-177, Denver, Colorado, June 1991.
7. Donald E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, second edition, 1973.
8. O. Martin and S. Otto. Combining simulated annealing with local search heuristics. To appear as a chapter of Metaheuristics in Combinatorial Optimization, volume 60 in the series Annals of Operations Research, edited by G. Laporte and I. Osman.
9. Kiyoshi Ono and Guy M. Lohman. Measuring the complexity of join enumeration in query optimization. In Proceedings of the 16th International Conference on Very Large Data Bases, pages 314-325, Brisbane, Australia, August 1990.
10. P. Griffiths Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. Access path selection in a relational database management system. In Proceedings of the ACM-SIGMOD 1979 International Conference on Management of Data, pages 23-34, Boston, Massachusetts, May 1979.
11. Michael Steinbrunn, Guido Moerkotte, and Alfons Kemper. Optimizing join orders. Technical Report MIP-9307, Universität Passau, 1993.
12. M. Steinbrunn. Heuristic and Randomised Optimisation Techniques in Object-Oriented Database Systems, infix-Verlag, Ringstraße 32, 53757 St. Augustin, Germany, 1996. Dissertation, Universität Passau.