Randomized algorithms for optimizing large join queries

ACM SIGMOD Record

Volumn 19, Issue 2, 1990, Pages 312-321

  Ioannidis, Y E ^a   Kang, Younkyung ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; OPTIMIZATION;

COST FUNCTIONS; ITERATIVE IMPROVEMENT; SIMULATED ANNEALING;

DATABASE SYSTEMS;

EID: 0025449072     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/93605.98740     Document Type: Article

References (19)

1. M. Carey and et al. The Architecture of the EXODUS Extensible DBMS, in Proc of the 1986 International Workshop on Object-Oriented Database Systems, edited by K Dittrich and U Dayal, Pacific Grove, CA, September 1986, pp 52-65
2. J. Grant and J Minker, Optimization in Deductive and Conventional Relational Database Systems, in Advances in Data Base Theory, Vol I, edited by H Gallaire, J Minker, and J M Nicolas, Plenum Press, New York, NY, 1981, pp 195-234
3. Y. E. Ioanmdis and E Wong, Query Optimization by Simulated Annealing, in Proceedings of the 1987 ACM-SIGMOD Conference, San Francisco, CA, June 1987, pp 9-22
4. M. Jarke and J Koch, Query Optimization in Database Systems, ACM Computing Surveys 16 (June 1984), pp 111-152
5. D. S. Johnson, C R Aragon, L A McGeoch, and C Schevon, Optimization by Simulated Annealing An Experimental Evaluation (Part I), unpublished manuscript, June 1987
6. W. Kim, D Reiner, and D Batory, Query Processing in Database Systems, Springer Verlag, New York, NY, 1986
7. S. Kirkpatrick, C D Gelatt, Jr, and M P Vecchi, Optimization by Simulated Annealing, Science 220, 4598 (May 1983), pp 671-680
8. R. Krishnamurthy, H Boral, and C Zaniolo, Optimization of Nonrecursive Queries, in Proceedings of the 12th International VLDB Conference, Kyoto, Japan, August 1986, pp 128-137
9. M. J. Litzkow, M Livny, and M W Mutka, Condor - A Hunter of Idle Workstations, in The 8th International Conference on Distributed Computing Systems, 1988, pp 104-111
10. G. M. Lohman, Grammar-like Functional Rules for Representing Query Optimization Alternatives, in Proceedings of the 1988 ACM-SIGMOD Conference, Chicago, IL, June 1988, pp 18-27
11. S. Nahar, S Sahni, and E Shragowitz, Simulated Annealing and Combinatorial Optimization, in Proceedings of the 23rd Design Automation Conference, 1986, pp 293-299
12. K. Ono and G M Lohman, Extensible Enumeration of Feasible Joins for Relational Query Optimization, IBM Research Report RJ6625, December 1988
13. F. Romeo and A Sangiovanni-Vincentelli, Probabilistic Hill Climbing Algorithms Properties and Applications, Proceedings of IEEE Conference on VLSI, 1985, pp 393-417
14. P. Selinger, ? M Astrahan, D D Chamberlin, R A Lone, and T G Price, Access Path Selection in a Relational Database Management System, in Proceedings of the 1979 ACM-SIGMOD Conference, Boston, MA, June 1979, pp 23-34
15. T. K. Sellis, Multiple Query Optimization, ACM Transactions on Database Systems 13, 1 (March 1988), pp 23-52
16. A. Swarm and A Gupta, Optimization of Large Join Queries, in Proceedings of the 1988 ACM-SIGMOD Conference, Chicago, IL, June 1988, pp 8-17
17. A. Swami, Optimization of Large Join Queries Combining Heuristics and Combinatonal Techniques, in Proceedings of the 1989 ACM-SIGMOD Corference, Portland, OR, June 1989, pp 367-376
18. J. D. Ullman, Principles of Database Systems, Computer Science Press, Rockville, MD, 1982
19. K. Y. Whang, Query Optimization in Office-by-Example, IBM Research report, RC11571, 1985