skip to main content
10.1145/237661.237707acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
Article
Free Access

Efficient and accurate cost models for parallel query optimization (extended abstract)

Published:03 June 1996Publication History
First page image

References

  1. BB90.K.P. Belkhale and P. Bannerjee. Approximate Algorithms for the Partitionable Independent Task Scheduling Problem, International Conference on Parallel Processing, 1990.]]Google ScholarGoogle Scholar
  2. DGS+.D.DeWitt, S. Ghandeharizadeh, D. Schneider, A. Bricker, H.Hsiao, R.Rasmussen. The Gamma Database Machine, IEEE TKDE, 1990.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. DeWGra92.D. DeWitt and J. Gray. The future of high performance database systems, Communications of the A CM, 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Gan92.S. Ganguly. Parallel Evaluation of Deductive Database Queries, PhD thes#s, Universzty of Texas, Austin, 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. GHK92.S. Ganguly, W. Hasan and R. Krishnamurthy. Query Optimization for Parallel Executions, SIGMOD, 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. GGMW.S. Ganguly, P. Gibbons, Y. Matias and A. Witkowski. AT&T Bell Labs Internal Technical Memorandum.]]Google ScholarGoogle Scholar
  7. GGJ78.M.R. Garey, R.L. Graham and D.S. Johnson. Performance Guarantees for Scheduling Algorithms, Operations Research, Jan. 1978.]]Google ScholarGoogle Scholar
  8. Goel95.A. Goel. Cost Models for Parallel Database Executions, Masters' Thesis, Department of Electrical Engineering, Rutgers University, New Brunswick, NJ, December 1994.]]Google ScholarGoogle Scholar
  9. Gra69.R.L. Graham. Bounds on Multiprocessing Timing Anomalies, SIAM J. Appl. Math., vol. 17, 1969.]]Google ScholarGoogle Scholar
  10. Gra66.R.L. Graham. Bounds on Multiprocessor Anomalies, Bell System Technical Journal, 45, 1966.]]Google ScholarGoogle Scholar
  11. Hon91.W. Hong and M. Stonebraker. Optimization of Parallel Query Execution Plans in XPRS, PDIS, December 1991.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. LVZ93.R.S.G. Lanzelotte, P. Valduriez and M. Zait. On the Effectiveness of Optimization Search Strategies for Parallel Execution, VLDB, 1993.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. LST91.H Lu, M C. Shah and K.L. Tan. Optimization of Multi-Way Join Queries for Parallel Execution, VLDB, 1991.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. NSHL93.T H. Niccum, J. Srivastav% B. Himatsingka# J- Z. Li. A Tree-Decomposition Approach to the Parallel Execution of Relational Query Plans, Technzcal Report, University of M, nnesota at Minneapolis.]]Google ScholarGoogle Scholar
  15. RSB94.S. Ramaswamy, S. Spatnekar and P. Bannerjee. A Convex Programming Approach for Exploiting Data and Functional Parallelism on Distributed Memory Multicomputers. International Con{erence on Parallel Processing, 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Sch90.D. Schneider. Complex Query Processing in Multiprocessor Database Machines, PhD thesis, University of Wisconsin, Madison, 1990.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. SAC+.P. Selinger, M.M. Astrahan, D.D. Chamberlain, R.A. Lorie and T.G. Price. Access Path Selection in a Relational Database Management System, SIGMOD, 1979.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. SriEls93.Jaideep Srivastava and G. Elsesser. Query Optimization for Parallel Relational Databases, PDIS, 1993.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. SYT93.Eugene J. Shekita, Honesty C. Young and Kian- Lee Tan. Multi-Join Optimization for Symmetric Multiprocessors, VLDB, 1993.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. TL94.K-L. Tan, H. Lu. On resource scheduling of multi-join queries in parallel database systems, Information Processing Letters, 48 (1993).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. TWPY92.J. Turek, J.L. Wolf, K.R. Pattipati and P.S. Yu. Scheduling Parallelizable Tasks: Putting it All on the Shelf, Sigrnetrics, 1992 .]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. TWY92.J.W. Turek, J.L. Wolf and P.S. Yu. Approximate Algorithms for Scheduling Parallelizable Tasks, Symposium on Parallel Algorithms and Architectures, 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. WC92.Q. Wang and K.H. Cheng. A Heuristic of Scheduling Parallel Tasks and its Analysis. SIAM Journal on Computing, April 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. ZZBS94.M. Ziane, M. Zait, and P. Borla-Salamet. Parallel Query Processing in DBS3, PDIS, 1993.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Efficient and accurate cost models for parallel query optimization (extended abstract)

        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 '96: Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
          June 1996
          249 pages
          ISBN:0897917812
          DOI:10.1145/237661

          Copyright © 1996 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: 3 June 1996

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          PODS '96 Paper Acceptance Rate22of84submissions,26%Overall Acceptance Rate642of2,707submissions,24%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader