Abstract

Imagine yourself standing in front of an exquisite buffet filled with numerous delicacies. Your goal is to try them all out, but you need to decide in what order. What exchange of tastes will maximize the overall pleasure of your palate? Although much less pleasurable and subjective, that is the type of problem that query optimizers are called to solve. Given a query, there are many plans that a database management system (DBMS) can follow to process it and produce its answer. All plans are equivalent in terms of their final output but vary in their cost, i.e., the amount of time that they need to run. What is the plan that needs the least amount of time? Such query optimization is absolutely necessary in a DBMS. The cost difference between two alternatives can be enormous. For example, consider the following database schema, which will be...

Citations

7296	E.: Genetic Algorithms - Goldberg - 1989
3501	Optimization by simulated annealing - Kirkpatrick, Gelatt, et al. - 1983
479	Access path selection in a relational database management system - Selinger, Astrahan, et al. - 1979
207	Query Optimization in Database Systems - Jarke, Koch - 1984
184	Equi-depth histograms for estimating selectivity factors for multi-dimensional queries - Muralikrishna, DeWitt - 1988
169	The Volcano Optimizer Generator: Extensibility and Efficient Search - Graefe, McKenna - 1993
159	The EXODUS optimizer generator - Graefe, DeWitt - 1987
155	Randomized algorithms for optimizing large join queries - Ioannidis, Kang - 1990
155	PracticaJ selectivity estimation through adaptive sampling - Lipton, Naughton, et al. - 1990
145	Accurate estimate of the number of tuples satisfying a condition - Piatetsky-Shapiro, Connell - 1984
139	Optimization of dynamic query evaluation plans - Cole, Graefe - 1994
135	Balancing histogram optimality and practicality for query result size estimation - Ioannidis, Poosala - 1995
120	Optimization of nonrecursive queries - Krishnamurthy, Boral, et al. - 1986
118	On the propagation of errors in the size of join results - Ioannidis, Christodoulakis - 1991
105	Grammar-like functional rules for representing query optimization alternatives - Lohman - 1988
103	Multiple Query Optimization - Sellis - 1988
96	Optimization of large join queries - Swami, Gupta - 1988
90	Tradeoffs in processing complex join queries via hashing in multiprocessor database machines - Schneider, DeWitt - 1990
89	R ∗ optimizer validation and performance evaluation for distributed queries - Mackert, Lohman - 1986
87	Query optimization by simulated annealing - Ioannidis, Wong - 1987
86	Sequential sampling procedures for query size estimation - Haas, Swami - 1992
82	Optimization of large join queries: Combining heuristic and combinatorial techniques - Swami - 1989
81	Universality of serial histograms - Ioannidis - 1993
81	Measuring the complexity of join enumeration in query optimization - Ono, Lohman
79	The Oprimization of Queries in Relational Databases - Kooi - 1980
75	Optimization of parallel query execution plans in xprs - Hong, Stonebraker - 1991
74	Implications of certain assumptions in database performance evaluation - Christodoulakis - 1984
73	Statistical profile estimation in database systems - Mannino, Chu, et al. - 1988
70	Query processing in a system for distributed databases (sdd-1 - Bernstein, Goodman, et al. - 1981
67	Quist: A system for semantic query optimization in relational databases - King - 1981
65	The design of XPRS - Stonebraker, Katz, et al. - 1988
57	On the effectiveness of optimization search strategies for parallel execution spaces - Lanzelotte, Valduriez, et al. - 1993
56	Optimal histograms for limiting worst-case error propagation in the size of join results - Ioannidis, Christodoulakis - 1993
56	Simple random sampling from relational databases - Olken, Rotem - 1989
52	On the Optimal Nesting Order for Computing N-Relational Joins - Ibaraki, Kameda - 1984
40	Simulated Annealing and Combinatorial Optimization - Nahar, Sahni, et al. - 1986
37	Multi-Join Optimization for Symmetric Multiprocessors - Shekita, Young, et al. - 1993
36	Dynamic Query Optimization in Rdb/VMS - Antoshenkov - 1993
32	A polynomial time algorithm for optimizing join queries - Swami, Iyer - 1993
25	A genetic algorithm for database query optimization - Bennett, Ferris, et al. - 1991
24	Integration of buffer management and query optimization in relational database environment - Cornell, Yu - 1989
22	randomized joinorder selection - why use transformations - Fast - 1994
22	Extensible/RuleBased Query Rewrite Optimization in Starburst - Pirahesh, Hellerstein, et al. - 1992
20	Astrahan et al, "System R: A relational approach to data management - M - 1976
20	Randomized Algorithms for Query Optimization - Kang - 1991
17	Sampling-based Selectivity Estimation for Joins using Augmented Frequent Value Statistics - Haas, Swami - 1995
13	Optimization by simulated annealing”. science 220 (4598): 671–680 - Kirkpatrick, Jr, et al. - 1983
8	An intelligent search method for query optimization by semijoins - Yoo, Lafortune - 1989
8	The Volcano optimizer generator: Extensibility and e cient search - Graefe, McKenna - 1993
8	et al. Starburst mid ight: As the dust clears - Haas - 1990