ABSTRACT
The optimization of queries in distributed database systems is known to be subject to delicate trade-offs. For example, the Mariposa database system allows users to specify a desired delay-cost tradeoff (that is, to supply a decreasing function u(d), specifying how much the user is willing to pay in order to receive the query results within time d); Mariposa divides a query graph into horizontal “strides,” analyzes each stride, and uses a greedy heuristic to find the “best” plan for all strides. We show that Mariposa's greedy heuristic can be arbitrarily far from the desired optimum. Applying a recent approach in multiobjective optimization algorithms to this problem, we show that the optimum cost-delay trade-off (Pareto) curve in Mariposa's framework can be approximated fast within any desired accuracy. We also present a polynomial algorithm for the general multiobjective query optimization problem, which approximates arbirarily well the optimum cost-delay tradeoff (without the restriction of Mariposa's heuristic stride subdivision).
- CHM.C. Chekuri, W. Hasan, and R. Motwani. Scheduling Problems in Parallel Query Optimization. Proc. of the Fourteenth ACM Symposium on Principles of Database Systems (PODS), 1995, pp. 255-265. Google ScholarDigital Library
- CJK.T. C. E. Cheng, A. Janiak, and M. Y. Kovalyov. Bicriterion Single Machine Scheduling with Resource Dependent Processing Times. SIAM J. Optimization, 8(2), pp. 617-630, 1998. Google ScholarDigital Library
- Cli.J. Climacao, Ed. Multicriteria Analysis. Springer- Verlag, 1997.Google ScholarCross Ref
- ESZ.F. Ergun, R. Sinha, L. Zhang. An Improved FPTAS for Restricted Shortest Path. Submitted, 2000.Google Scholar
- EHJ+.O. Etzioni, S. Hanks, T. Jiang, R. M. Karp, O. Madari, and O. Waarts. Efficient Information Gathering on the Internet. Proc. 37th IEEE Symp. on Foundations of Computer Science, pp. 234-243, 1996. Google ScholarDigital Library
- FOCS.Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000.Google Scholar
- Han.P. Hansen. Bicriterion Path Problems. Proc. 3rd Conf. Multiple Criteria Decision Making Theory and Application, pp. 109-127, Springer Verlag LNEMS 177, 1979.Google Scholar
- Har.R. Hartley. Survey of Algorithms for Vector Optimization Problems. Multiobjective Decision Making, pp. 1-34, S. French, R.Hartley, L.C. Thomas, D. J. White Eds., Academic Press, 1983.Google Scholar
- HM.W. Hasan, R. Motwani. Optimization Algorithms for Exploiting the Parallelism-Communication Trade-off in Pipelined Parallelism. Proc. of the 20th International Conference on Very Large Data Bases (VLDB), pp. 36-47, 1994. Google ScholarDigital Library
- PY.C. H. Papadimitriou and M. Yannakakis. On the Approximability of Trade-offs and Optimal Access of Web Sources. Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000. Google ScholarDigital Library
- SAP+.M. Stonebraker, P. M. Aoki, A. Pfeffer, A. Sah, J. Sidell, C. Staelin, and A. Yu. Mariposa: A Wide- Area Distributed Database System. VLDB Journal, 5:1, pp. 48-63, 1996. Google ScholarDigital Library
- Wa.A. Warburton. Approximation of Pareto Optima in Multiple-Objective Shortest Path Problems. Operations Research, 35, pp. 70-79, 1987. Google ScholarDigital Library
Index Terms
- Multiobjective query optimization
Recommendations
Evolutionary multiobjective optimization
GECCO '11: Proceedings of the 13th annual conference companion on Genetic and evolutionary computationMany optimization problems are multiobjective in nature in the sense that multiple, conflicting criteria need to be optimized simultaneously. Due to the conflict between objectives, usually, no single optimal solution exists. Instead, the optimum ...
Tutorial on Evolutionary Multiobjective Optimization
GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary ComputationMany optimization problems are multiobjective in nature in the sense that multiple, conflicting criteria need to be optimized simultaneously. Due to the conflict between objectives, usually, no single optimal solution exists. Instead, the optimum ...
GECCO 2016 Tutorial on Evolutionary Multiobjective Optimization
GECCO '16 Companion: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference CompanionMany optimization problems are multiobjective in nature in the sense that multiple, conflicting criteria need to be optimized simultaneously. Due to the conflict between objectives, usually, no single optimal solution exists. Instead, the optimum ...
Comments