A new, highly efficient, and easy to implement top-down join enumeration algorithm

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2011, Pages 864-875

  Fender, Pit ^a   Moerkotte, Guido ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ENUMERATION ALGORITHMS; HIGH IMPACT; JOIN OPERATION; O(1) COMPLEXITY; QUERY GRAPH; QUERY OPTIMIZER; THEORETICAL RESULT; TOP-DOWN ALGORITHMS; TOPDOWN;

ALGORITHMS; PLANT EXTRACTS; SEARCH ENGINES;

TREES (MATHEMATICS);

EID: 79957814785     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2011.5767901     Document Type: Conference Paper

References (9)

1. Y. E. Ioannidis and Y. C. Kang, "Left-deep vs. bushy trees: an analysis of strategy spaces and its implications for query optimization," SIGMOD Rec., vol. 20, no. 2, pp. 168-177, 1991.
2. K. Ono and G. M. Lohman, "Measuring the complexity of join enumeration in query optimization," in VLDB, 1990, pp. 314-325.
3. G. Moerkotte and T. Neumann, "Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products," in VLDB, 2006, pp. 930-941.
4. D. DeHaan and F. W. Tompa, "Optimal top-down join enumeration," in SIGMOD, 2007, pp. 1098-1109.
5. L. M. Haas, M. J. Carey, M. Livny, and A. Shukla, "Seeking the truth about ad hoc join costs," VLDB Journal, vol. 6, pp. 241-256, 1997. (Pubitemid 127373757)
6. B. Vance and D. Maier, "Rapid bushy join-order optimization with cartesian products," in SIGMOD, 1996, pp. 35-46. (Pubitemid 126440754)
7. P. Fender and G. Moerkotte, "A new, highly efficient, and easy to implement top-down join enumeration algorithm (extended version)," University of Mannheim, Tech. Rep., 2010.
8. D. DeHaan and F. W. Tompa, "Optimal top-down join enumeration (extended version)," University of Waterloo, Tech. Rep., 2007.
9. S. Baase and A. V. Gelder, Computer Algorithms: Introduction to Design and Analysis. Addison-Wesley, 1999.