The complexity of transformation-based join enumeration

Proceedings of the 23rd International Conference on Very Large Databases, VLDB 1997

Volumn , Issue , 1997, Pages 306-315

  Pellenkoft, Arjan ^a,b   Galindo Legaria, Céar A ^a   Kersten, Martin ^b  

^a MICROSOFT   (United States)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON SUBEXPRESSION; COMMUTATIVITY; GENERIC TRANSFORMATIONS; MULTIPLE-PATH; NOCV1; POSSIBLE RULE; SEARCH SPACES; TRANSFORMATION BASED; TRANSFORMATION RULES;

EID: 84993661708     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. J.A. Blakeley, W. J. McKenna, and G. Graefe. Experiences bulding the open oodb query optimizer. Proceedings of the ACM SIGMOD Conf on Management of Data, Washington DC, 1993.
2. S. Chaudhuri and K. Shim. Optimizing queries with aggregate vieuws. International Conference on Extending Database Technology, Avignon, France, pages 167- 182, 1996.
3. G. Graefe and D. J. Dewitt. The exodus optimizer generator. Proc. of the ACMSIGMOD Conference on Management of Data, pages 160-172,1987.
4. C. A. Galindo-Legaria, A. Pellenkoft, and M. L. Kersten. Uniformly-distributed random generation of join orders. In Proceedings of the International Conference on Database Theory, Prague, pages 280-293, 1995. Also CWI Technical Report CSR9431.
5. C. A. Galindo-Legaria and Arnon Rosenthal. Outerjoin simplification and reordering for query optimization. To appear in ACM Transactions on Database Systems, 1996.
6. G. Graefe and W. J. McKenna. The Volcano optimizer generator: Extensibility and efficient search. Procedings of the 9th International Conference on Data Engineering, Vienna, Austria, pages 209-218, 1993.
7. J.M. Hellerstein and J.F. Naughton. Query execution techiques for caching expensive methods. Proceedings of the ACM SIGMOD Conf on Management of Data, Montreal, pages 423 - 434, 1996.
8. Y. E. Ioannidis and Y. C. Kang. Leftdeep vs. bushy trees: An analysis of strategy spaces and its implications for query optimization. Proc. of the ACM-SIGMOD Conference on Management of Data, pages 168-177,1991.
9. Y. E. Ioannidis and E. Wong. Query optimization by simulated annealing. Proc. of the ACM-SIGMOD Conference on Management of Data, pages 9-22, 1987.
10. Y. C. Kang. Randomized Algorithms for Query Optimization. PhD thesis, University of Wisconsin-Madison, 1991. Technical report #1053.
11. R. S. G. Lanzelotte, P. Valduriez, and M. Zai't. On the effectiveness of optimization search strategies for parallel execution spaces. Proc. of the 19th VLDB Conference, Dublin, Ireland, pages 493-504,1993.
12. W. J. McKenna. Eficient Search in Extensible Database Query Optimization: The Volcano Optimizer Generator. PhD thesis, University of Colorado, Boulder, 1993.
13. K. Ono and G. M. Lohman. Measuring the complexity of join enumeration in query optimization. Proc. of the 16th VLDB Conference, Brisbane, Australia, pages 314- 325, 1990.
14. A. Pellenkoft, G.A. Galindo-Legaria, and M.L. Kersten. Complexity of transformation based optimizers and duplicate free generation of alternatives. Technical Report CS-R9639, CWI, 1996.
15. A. N. Swami and A. Gupta. Optimization of large join queries. Proc. of the ACMSIGMOD Conference on Management of Data, pages 8-17, 1988.
16. P. Seshadri, J.M. Hellerstein, H. Pirahesh, T.Y.C. Leung, R. Ramakrishnan, D. Srivastava, P.J. Stuckey, and S. Sudarshan. Cost-based optimization for magic: Algebra and implementation. Proceedings of the ACM SIGMOD Conf on Management of Data, Montreal, pages 435-446, 1996.
17. B. Vance. Complexity of join enumeration in starburst, 1996. Manuscript.
18. B. Vance. Personal communication, 1996.
19. B. Vance and D. Maier. Rapid bushy joinorder optimization with Cartesian products. In Proceedings of the ACM SIGMOD Conf on Management of Data, Montreal, pages 35-46, 1996.