Optimization of Large Join Queries

ACM SIGMOD Record

Volumn 17, Issue 3, 1988, Pages 8-17

  Swami, Arun ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976665228     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/971701.50203     Document Type: Article

References (18)

1. [BHH78] G.E.P. Box, W. G. Hunter, and J. S. Hunter. Statistics for Experimenters. John Wiley and Sons, 1978.
2. [Dav78] O. L. Davies, editor. The Design and Analysis of Industrial Experiments. Longman Group Limited, 2nd edition, 1978.
3. [DKO*84] D. J. Dewitt, R. H. Katz, F. Olken, L. D. Shapiro, M. R. Stonebraker, and D. Wood. Implementation Techniques for Main Memory Database Systems. In Proceedings of ACM-SIGMOD International Conference on Management of Data, pages 1-8, June 1984.
4. [DW83] S. Dowdy and S. Wearden. Statistics for Re-search. John Wiley and Sons, 1983.
5. [FBC*87] D. H. Fishman, D. Beech, H. P. Cate, E. C. Chow, T. Connors, J. W. Davis, N. Derrett, C. G. Hoch, W. Kent, P. Lyngbaek, B. Mahbod, M. A. Neimat, T. A. Ryan, and M. C. 5(1): 48–69, January 1987.
6. [HRS86] M. D. Huang, F. Romeo, and A. Sangiovanni-Vincentelli. An Efficient General Cooling Schedule for Simulated Annealing. In Proceedings of the 1986 IC CAD Conference, pages 381–384, 1986.
7. [IK84] T. Ibaraki and T. Kameda. Optimal Nesting for Computing N-relational Joins. ACM Transactions on Database Systems, 9(3):482–502, October 1984.
8. [IW87] Y. E. Ioannidis and E. Wong. Query Optimization by Simulated Annealing. In Proceedings of ACM-SIGMOD International Conference on Management of Data, pages 9-22, 1987.
9. [JAMS87] D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. Optimization by Simulated Annealing: An Experimental Evaluation (Part I). June 1987. Draft.
10. [JK84] M. Jake and J. Koch. Query Optimization in Database Systems. ACM Computing Surveys, 16(2):111–152, June 1984.
11. [KBZ86] R. Krishnamurthy, H. Boral, and C. Zaniolo. Optimization of Nonrecursive Queries. In Proceedings of the Twelth International Conference on Very Large Data Bases, pages 128–137, Kyoto, Japan, 1986.
12. [KGV83] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by Simulated Annealing. Science, 220(4598):671–680, May 1983.
13. [NMF87] R. E. Nance, R. L. Moose, and R. V. Foutz. A Statistical Technique for Comparing Heuristics: An Example from Capacity Assignment Strategies in Computer Network Design. Communications of the ACM, 30(5):430–442, May 1987.
14. [NSS86] S. Nahar, S. Sahni, and E. Shragowitz. Simulated Annealing and Combinatorial Optimization. In Proceedings of the 23rd Design Automation Conference, Pages 293–299, 1986.
15. [PS82] C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization : Algorithms and complexity. Prentice-Hall, 1982.
16. [SAC*79] P. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. Access Path Selection in a Relational Database Management System. In Proceedings of ACM-SIGMOD International Conference on Management of Data, 1979.
17. [Swa87a] A. Swami. A Cost Model For Memory Resident Databases. April 1987. Computer Science Department, Stanford University.
18. [Swa87b] A. Swami. Optimization of Large Join Queries. Technical Report, Software Technology Laboratory, Hewlett-Packard Laboratories, November 1987. Report STL-87–15.