Optimization of Dynamic Query Evaluation Plans

ACM SIGMOD Record

Volumn 23, Issue 2, 1994, Pages 150-160

  Cole, Richard L ^a   Graefe, Goetz ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b PORTLAND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; OBJECT ORIENTED PROGRAMMING; OPTIMIZATION;

COMPILE TIME; DYNAMIC QUERY EVALUATION; RUN TIME;

QUERY LANGUAGES;

EID: 0028447931     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/191843.191872     Document Type: Article

References (26)

1. G. Antoshenkov, “Dynamic Query Optimization in Rdb/VMS”, Proc. IEEE Int'l. Conf. on Data Eng., Vienna, Austria, April 1993, 538.
2. J. A. Blakeley, W. J. McKenna, and G. Graefe, “Experiences Building the Open OODB Query Optimizer”, Proc. ACM SIGMOD Conf., Washington, DC, May 1993, 287.
3. P. Bodorik, J. Pyra, and J. S. Riordon, “Correcting Execution of Distributed Queries”, Proc. Int'l. Symp. on Databases in Parallel and Distributed Systems, Dublin, Ireland, July 1990, 192.
4. D. D. Chamberlin, M. M. Astrahan, W. F. King, R. A. Lorie, J. W. Mehl, T. G. Price, M. Schkolnik, P. G. Selinger, D. R. Slutz, B. W. Wade, and R. A. Yost, “Support for Repetitive Transactions and Ad Hoc Queries in System R”, ACM Trans. on Database Sys. 6, 1 (March 1981), 70.
5. S. Christodoulakis, “Implications of Certain Assumptions in Database Performance Evaluation”, ACM Trans. on Database Sys. 9, 2 (June 1984), 163.
6. R. L. Cole, M. J. Anderson, and R. J. Bestgen, “Query Processing in the IBM Application System/400”, IEEE Data Eng. Bull. 16, 4 (December 1993), 19.
7. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, McGraw-Hill, New York, NY, 1989.
8. M. A. Derr, S. Morishita, and G. Phipps, “Design and Implementation of the Glue-Nail Database System”, Proc. ACM SIGMOD Conf., Washington, DC, May 1993, 147.
9. S. Ganguly, W. Hasan, and R. Krishnamurthy, “Query Optimization for Parallel Execution”, Proc. ACM SIGMOD Conf., San Diego, CA, June 1992, 9.
10. G. Graefe and K. Ward, “Dynamic Query Evaluation Plans”, Proc. ACM SIGMOD Conf., Portland, OR, May-June 1989, 358.
11. G. Graefe, “Query Evaluation Techniques for Large Databases”, ACM Computing Surveys 25, 2 (June 1993), 73-170.
12. G. Graefe and W. J. McKenna, “The Volcano Optimizer Generator: Extensibility and Efficient Search”, Proc. IEEE Int'l. Conf. on Data Eng., Vienna, Austria, April 1993, 209.
13. W. Hasan and H. Pirahesh, “Query Rewrite Optimization in Starburst”, Comp. Sci. Res. Rep., San Jose, CA, August 1988.
14. W. Hong and M. Stonebraker, “Optimization of Parallel Query Execution Plans in XPRS”, Distr. and Parallel Databases 1, 1 (January 1993), 9.
15. Y. E. Ioannidis and S. Christodoulakis, “On the Propagation of Errors in the Size of Join Results”, Proc. ACM SIGMOD Conf., Denver, CO, May 1991, 268.
16. Y. E. Ioannidis, R. T. Ng, K. Shim, and T. K. Sellis, “Parametric Query Processing”, Proc. Int'l. Conf. on Very Large Data Bases, Vancouver, BC, Canada, August 1992, 103.
17. T. Keller, G. Graefe, and D. Maier, “Efficient Assembly of Complex Objects”, Proc. ACM SIGMOD Conf., Denver, CO, May 1991, 148.
18. G. M. Lohman, “Is Query Optimization a ‘Solved’ Problem?”, in Proc. Workshop on Database Query Optimization, G. Graefe (editor), Oregon Graduate Center Comp. Sci. Tech. Rep. 89-005, Beaverton, OR, May 1989, 13.
19. L. F. Mackert and G. M. Lohman, “Index Scans Using a Finite LRU Buffer: A Validated I/O Model”, ACM Trans. on Database Sys. 14, 3 (September 1989), 401.
20. C. Mohan, D. Haderle, Y. Wang, and J. Cheng, “Single Table Access Using Multiple Indexes: Optimization, Execution and Concurrency Control Techniques”, Lecture Notes in Comp. Sci. 416 (March 1990), 29, Springer Verlag.
21. K. Ono and G. M. Lohman, “Measuring the Complexity of Join Enumeration in Query Optimization”, Proc. Int'l. Conf. on Very Large Data Bases, Brisbane, Australia, August 1990, 314.
22. J. Orenstein, S. Haradhvala, B. Margulies, and D. Sakahara, “Query Processing in the ObjectStore Database System”, Proc. ACM SIGMOD Conf., San Diego, CA, June 1992, 403.
23. P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price, “Access Path Selection in a Relational Database Management System”, Proc. ACM SIGMOD Conf., Boston, MA, May-June 1979, 23. Reprinted in M. Stonebraker, Readings in Database Sys., Morgan-Kaufman, San Mateo, CA, 1988.
24. K. Seppi, J. Barnes, and C. Morris, “A Bayesian Approach to Query Optimization in Large Scale Data Bases”, The Univ. of Texas at Austin ORP 89-19, Austin, TX, 1989.
25. M. M. Tsangaris and J. F. Naughton, “On the Performance of Object Clustering Techniques”, Proc. ACM SIGMOD Conf., San Diego, CA, June 1992, 144.
26. R. H. Wolniewicz and G. Graefe, “Algebraic Optimization of Computations over Scientific Databases”, Proc. Intl' Conf. on Very Large Data Bases, Dublin, Ireland, August 1993, 13.