skip to main content
10.1145/375551.375560acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
Article

Multiobjective query optimization

Published:01 May 2001Publication History

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).

References

  1. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. Cli.J. Climacao, Ed. Multicriteria Analysis. Springer- Verlag, 1997.Google ScholarGoogle ScholarCross RefCross Ref
  4. ESZ.F. Ergun, R. Sinha, L. Zhang. An Improved FPTAS for Restricted Shortest Path. Submitted, 2000.Google ScholarGoogle Scholar
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. FOCS.Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000.Google ScholarGoogle Scholar
  7. 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 ScholarGoogle Scholar
  8. 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 ScholarGoogle Scholar
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  12. Wa.A. Warburton. Approximation of Pareto Optima in Multiple-Objective Shortest Path Problems. Operations Research, 35, pp. 70-79, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Multiobjective query optimization

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            PODS '01: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
            May 2001
            301 pages
            ISBN:1581133618
            DOI:10.1145/375551

            Copyright © 2001 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 May 2001

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            PODS '01 Paper Acceptance Rate26of99submissions,26%Overall Acceptance Rate642of2,707submissions,24%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader