Optimal top-down join enumeration

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2007, Pages 785-796

  DeHaan, David ^a   Tompa, Frank Wm ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Branch and bound; Dynamic programming; Join enumeration; Memoization; Query optimization; Top down

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD; DATA MINING; DATABASE SYSTEMS; DYNAMIC PROGRAMMING; INFORMATION RETRIEVAL;

JOIN ENUMERATION; MEMOIZATION; QUERY OPTIMIZATION; TOP DOWN JOIN ENUMERATION;

QUERY PROCESSING;

EID: 35448963923     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247480.1247567     Document Type: Conference Paper

References (23)

1. R. Ahmed, A. Lee, A. Witkowski, D. Das, H. Su, M. Zait, and T. Cruanes. Cost-based query transformation in Oracle. In Proc. 32nd International Conference on Very Large Data Bases, pages 1026-1036, 2006.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
3. I. T. Bowman and G. N. Paulley. Join enumeration in a memory-constrainted environment. In Proc. 16th International Conference on Data Engineering, pages 645-654, 2000.
4. S. Chaudhuri, R. Krishnamurthy, S. Potamianos, and K. Shim. Optimizing queries with materialized views. In Proc. 11th International Conference on Data Engineering, pages 190-200, 1995.
5. D. DeHaan and F. W. Tompa. Optimal top-down join enumeration (extended version). Technical Report CS-2007-02, School of Computer Science, University of Waterloo, 2007.
6. H. Garcia-Molina, J. D. Ullman, and J. Widom. Database Systems: The Complete Book. Prentice Hall PTR, 2001.
7. G. Graefe. The Cascades framework for query optimization. IEEE Data Engineering Bulletin, 18(3):19-29, 1995.
8. G. Graefe. The Microsoft relational engine. In Proc. 12th International Conference on Data Engineering, pages 160-161, 1996.
9. G. Graefe and W. J. McKenna. The Volcano optimizer generator: Extensibility and efficient search. In Proc. 9th International Conference on Data Engineering, pages 209-218, 1993.
10. N. Kabra and D. J. DeWitt. OPT++: An object-oriented implementation for extensible database query optimization. VLDB J., 8(1):55-78, 1999.
11. W. J. McKenna, L. Burger, C. Hoang, and M. Truong. EROC: A toolkit for building NEATO query optimizers. In Proc. 22nd International Conference on Very Large Data Bases, pages 111-121, 1996.
12. 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 Proc. 32nd International Conference on Very Large Data Bases, pages 930-941, 2006.
13. E. F. Moore and C. E. Shannon. Reliable circuits using less reliable relays. J. Franklin Institute, 262(3,4):191-208, 281-297, 1956.
14. S. Morishita. Avoiding cartesian products for multiple joins. J. ACM, 44(1):57-85, 1997.
15. K. Ono and G. M. Lohman. Measuring the complexity of join enumeration in query optimization. In Proc. 16th International Conference on Very Large Data Bases, pages 314-325, 1990.
16. A. Pellenkoft, C. A. Galindo-Legaria, and M. L. Kersten. Complexity of transformation-based optimizers and duplicate-free generation of alternatives. Technical Report CS-R9639, CWI, 1996.
17. A. Pellenkoft, C. A. Galindo-Legaria, and M. L. Kersten. The complexity of transformation-based join enumeration. In Proc. 2Srd International Conference on Very Large Data Bases, pages 306-315, 1997.
18. H. Pirahesh, J. M. Hellerstein, and W. Hasan. Extensible/rule based query rewrite optimization in Starburst. In Proc. ACM SIGMOD International Conference on Management of Data, pages 39-48, 1992.
19. J. S. Provan and D. R. Shier. A paradigm for listing (s,t)-cuts in graphs. Algorithmica, 15(4):351-372, April 1996.
20. P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. Access path selection in a relational database management system. In Proc. ACM SIGMOD International Conference on Management of Data, pages 23-34, 1979.
21. L. D. Shapiro, D. Maier, P. Benninghoff, K. Billings, Y. Fan, K. Hatwal, Q. Wang, Y. Zhang, H. min Wu, and B. Vance. Exploiting upper and lower bounds in top-down query optimization. In International Database Engineering & Applications Symposium, pages 20-33, 2001.
22. S. Tsukiyama, I. Shirakawa, H. Ozaki, and H. Ariyoshi. An algorithm to enumerate all cutsets of a graph in linear time per cutset. J. ACM, 27(4):619-632, 1980.
23. B. Vance and D. Maier. Rapid bushy join-order optimization with cartesian products. In Proc. ACM SIGMOD International Conference on Management of Data, pages 35-46, 1996.