A new heuristic for optimizing large queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1460, Issue , 1998, Pages 726-735

  Fegaras, Leonidas ^a  

^a The University of Texas at Arlington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; EXPERT SYSTEMS; ITERATIVE METHODS; POLYNOMIAL APPROXIMATION; QUERY PROCESSING; SEMANTICS; SIMULATED ANNEALING; TREES (MATHEMATICS);

COMBINATORIAL OPTIMIZATION TECHNIQUES; GREEDY ALGORITHMS; INTERMEDIATE RESULTS; ITERATIVE IMPROVEMENTS; OPTIMIZATION TECHNIQUES; POLYNOMIAL-TIME ALGORITHMS; QUERY SPECIFICATION; SEMANTIC INFORMATION;

DYNAMIC PROGRAMMING;

EID: 84949198075     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054528     Document Type: Conference Paper

References (17)

1. R. Cattell. The Object Database Standard: ODMG-93. Morgan Kaufmann, 1994.
2. S. Cluet and C. Delobel. A General Framework for the Optimization of Object- Oriented Queries. Proceedings of the ACM-SIGMOD International Conference on Management of Data, San Diego, California, pp 383-392, June 1992.
3. L. Fegaras. Optimizing Large OODB Queries. In Fifth International Conference on Deductive and Object-Oriented Databases, Montreux, Switzerland, December 1997.
4. L. Fegaras. A New Heuristic for Optimizing Large Queries (extended paper). Available at http://www-cse.uta.edu/~fegaras/order.ps.gz, February 1998.
5. L. Fegaras. Query Unnesting in Object-Oriented Databases. ACM SIGMOD International Conference on Management of Data, Seattle, Washington, June 1998.
6. T. Ibaraki and T. Kameda. Optimal Nesting for Computing N-Relational Joins. ACM Transactions on Database Systems, 9(3):482-502, September 1984.
7. Y. Ioannidis and Y. Kang. Randomized Algorithms for Optimizing Large Join Queries. In Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, N J, pp 312-321, May 1990.
8. Y. Ioannidis and Y. Kang. Left-deep vs. Bushy Trees: An Analysis of Strategy Spaces and its Implications for Query Optimization. Proceedings of the ACMSIGMOD International Conference on Management of Data, Denver, Colorado, 20(2):168-177, May 1991.
9. R. Krishnamurthy, H. Boral, and C. Zaniolo. Optimization of Nonrecursive Queries. In Y. Kambayashi, editor, Proceedings of the Twelfth International Conference on Very Large Databases, Kyoto, Japan, pp 128-137, August 1986.
10. M. Muralikrishna. Improved Unnesting Algorithms for Join Aggregate SQL Queries. In Proc. Int'l. Conf. on Very Large Data Bases, page 91, Vancouver, BC, Canada, August 1992.
11. K. Ono and G. Lohman. Measuring the Complexity of Join Enumeration in Relational Query Optimization. In Proceedings of the 16th Conference on Very Large Databases, Morgan Kaufman pubs. (Los Altos CA), Brisbane, August 1990.
12. W. Scheufele and G. Moerkotte. Efficient Dynamic Programming Algorithms for Ordering Expensive Joins and Selections. International Conference on Extending Data Base Technology, Valencia, Spain, March 1997.
13. P. Selinger, M. Astrahan, D. Chamberlin, R. Lorie, and T. Price. Access Path Selection in a Relational Database Management System. Proceedings of the ACM-SIGMOD International Conference on Management of Data, Boston, Massachusetts, pp 23-34, May 1979.
14. M. Steinbrunn, G. Moerkotte, and A. Kemper. Heuristic and Randomized Optimization for the Join Ordering Problem. VLDB Journal, 6(3):191-208, 1997.
15. A. Swami. Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques. In Proceedings of the ACM-SIGMOD International Conference on Management of Data, Portland, Oregon, pp 367-376, May 1989.
16. A. Swami and A. Gupta. Optimization of Large Join Queries. Proceedings of the ACM-SIGMOD International Conference on Management of Data, Chicago, Illinois, 13(3):8-17, September 1988.
17. K. Youssefi and E. Wong. Query Processing in a Relational Database Management System. In Proceedings of the Fifth International Conference on Very Large Databases, pp 409-417,1979