Left-deep vs. bushy trees: An analysis of strategy spaces and its implications for query optimizationf

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 1991, Pages 168-177

  Ioannidis, Yannis E ^a   Kang, Younkyung Cha ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; GAME THEORY; SIMULATED ANNEALING;

ITERATIVE IMPROVEMENTS; OPTIMIZERS; STRATEGY SPACE; TWO-PHASE OPTIMIZATIONS;

FORESTRY;

EID: 85054364788     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/115790.115813     Document Type: Conference Paper

References (16)

1. Grant, J. and J. Minker, "Optimization in Deductive and Conventional Relational Database Systems", in Advances in Data Base Theory Vol. 1, edited by H. Gallaire, J. Minker and J. M. Nicolas, Plenum Press, New York, N. Y., 1981, pp. 195-234.
2. Ibaraki, T. and T. Kameda, "On the Optimal Nesting Order for Computing N-Relational Joins", ACM TODS 9, #3(September 1984), pp. 482-502.
3. Ioannidis, Y. E. and E. Wong, "Query Optimization by Simulated Annealing", in Proc. of the 1987 ACM-SIGMOD Conference on the Management of Data, San Francisco, CA, May 1987, pp. 9-22.
4. Ioannidis, Y. E. and Y. C. Kang, "Randomized Algorithms for Optimizing Large Join Queries", in Proc. of the 1990 ACM-SIGMOD Conference on the Management of Data, Atlantic City, NJ, May 1990, pp. 312-321.
5. Jarke, M. and J. Koch, "Query Optimization in Database Systems", ACM Computing Surveys 16, 2(June 1984), pp. 111-152.
6. Kang, Y., "Randomized Algorithms for Query Optimization", Ph. D. Thesis, University of Wisconsin, Madison, WI, April 1991.
7. Kim, W., D. Reiner, and D. Batory, Query Processing in Database Systems, Springer Verlag, New York, NY, 1986.
8. Kirkpatrick, S., C. D. Gelatt, Jr., and M. P. Vecchi, "Optimization by Simulated Annealing", Science 220, 4598(May 1983), pp. 671-680.
9. Krishnamurthy, R., H. Boral, and C. Zaniolo, "Optimization of Nonrecursive Queries", in Proc. 12th International VLDB Conference, Kyoto, Japan, August 1986, pp. 128-137.
10. Monma, C. L. and J. B. Sidney, "Sequencing with Series-Parallel Precedence Constraints", Mathematics of Operations Research 4, 3(August 1979), pp. 212-224.
11. Nahar, S., S. Sahni, and E. Shragowitz, "Simulated Annealing and Combinatorial Optimization", in Proc. of the 23rd Design Automation Conference, 1986, pp. 293-299.
12. Rothschild, V. and N. Logothetis, Probability Distributions, John Wiley and Sons, New York, N. Y., 1986.
13. Selinger, P. et al., "Access Path Selection in a Relational Data Base System", in Proc. of the 1979 ACM-SIGMOD Conference on the Management of Data, Boston, MA, June 1979, pp. 23-34.
14. Sellis, T. K., "Global Query Optimization", in Proc. of the 1986 ACM-SIGMOD Conference on the Management of Data, Washington, DC, May 1986, pp. 191-205.
15. Swami, A. and A. Gupta, "Optimization of Large Join Queries", in Proc. of the 1988 ACM-SIGMOD Conference on the Management of Data, Chicago, IL, June 1988, pp. 8-17.
16. Ullman, J. D., Principles of Database Systems, Computer Science Press, Rockville, MD, 1982.