|
|
 | |  |
Volume 42, Number 1, 2003
Autonomic Computing |
|
Table of contents:
 HTML PDF | |
This article:
HTML PDF | Copyright info |
| | | |
| | |
LEO: An autonomic query optimizer for DB2 - References
|
|
by
V. Markl, G. M. Lohman, and V. Raman
|
| |
|
Cited references
-
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,” Proceedings of the ACM SIGMOD International Conference on Management of Data, Boston, MA, May 1979, ACM, New York (1979), pp. 23–24.
-
A. Van Gelder, “Multiple Join Size Estimation by Virtual Domains,” Proceedings of the Twelfth ACM Symposium on Principles of Database Systems (May 1993), pp. 180–189.
-
A. N. Swami and K. B. Schiefer, “On the Estimation of Join Result Sizes,” 4th International Conference on Extending Database Technology (March 1994), pp. 287–300.
-
R. Ahad, K. V. B. Rao, and D. McLeod, “On Estimating the Cardinality of the Projection of a Database Relation,” ACM Transactions on Database Systems 14, No. 1, pp. 28–40 (1989).
-
C. Lynch, “Selectivity Estimation and Query Optimization in Large Databases with Highly Skewed Distributions of Column Values,” Proceedings of the 14th International Conference on Very Large Databases (August 1988), pp. 240–251.
-
Y. E. Ioannidis and S. Christodoulakis, “On the Propagation of Errors in the Size of Join Results,” Proceedings of the ACM SIGMOD International Conference on Management of Data, Denver, CO, May 1991, ACM, New York (1991), pp. 268–277.
-
V. Poosala, Y. Ioannidis, P. Haas, and E. Shekita, “Improved Histograms for Selectivity Estimation of Range Predicates,” Proceedings of the ACM SIGMOD International Conference on Management of Data, Montreal, Canada, June 1996, ACM, New York (1996), pp. 294–305.
-
V. Poosala and Y. Ioannidis, “Selectivity Estimation Without the Attribute Value Independence Assumption,” Proceedings of the 23rd International Conference on Very Large Databases (VLDB 1997).
-
P. Haas, J. Naughton, S. Seshadri, and A. Swami, Selectivity and Cost Estimation for Joins Based on Random Sampling, Research Report RJ-9577, IBM Thomas J. Watson Research Center, Yorktown Heights, NY 10598 (1993).
-
T. Urhan, M. J. Franklin, and L. Amsaleg, “Cost-Based Query Scrambling for Initial Delays,” Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, WA, June 1998, ACM, New York (1998), pp. 130–141.
-
M. Stillger, G. Lohman, V. Markl, and M. Kandil, “LEO—DB2's Learning Optimizer,” Proceedings of the 27th International Conference on Very Large Databases (September 2001), pp. 19–28.
-
N. Kabra and D. DeWitt, “Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans,” Proceedings of the ACM SIGMOD International Conference on Management of Data (June 1998), pp. 106–117.
-
N. Roussopoulos, “Materialized Views and Data Warehouses,” SIGMOD Record 27, No. 1, 21–26, ACM, New York (1998).
-
M. Zaharioudakis, R. Cochrane, G. Lapis, H. Pirahesh, and M. Urata, “Answering Complex SQL Queries Using Automatic Summary Tables,” Proceedings of the ACM SIGMOD International Conference on Management of Data, Dallas, TX, May 2000, ACM, New York (2000), pp. 105–116.
-
S. Chaudhuri, R. Krishnamurthy, S. Potamianos, and K. Shim, “Optimizing Queries with Materialized Views,” Proceedings of the Eleventh International Conference on Data Engineering (March 1995), pp. 190–220.
-
R. Chirkova, A. Y. Halevy, and D. Suciu, “A Formal Perspective on the View Selection Problem,” Proceedings of the 27th International Conference on Very Large Databases (September 2001), pp. 59–68.
-
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by Simulated Annealing,” Science 220, No. 4598, 671–680 (May 1983).
-
V. Markl and G. M. Lohman, “Learning Table Access Cardinalities with LEO,” Proceedings of the ACM SIGMOD International Conference on Management of Data, Madison, WI, June 2002, ACM, New York (2002), p. 613.
|
|
|
|
|
