Scheduling queries for parallel execution on multicomputer database management system

  • Yu-lung Lo
  • Kien A. Hua
  • Wallapak Tavanapong
Parallel and Distributed Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1134)


In this paper, we investigate two scheduling approaches for multicomputer-based parallel database systems: the competition-based technique allows queries to compete freely for computing resources, while the planning-based scheme relies on a centralized scheduler to plan the execution of all queries. Our studies show that competition-based though provides impressive performance, the planning-based is consistently the better approach.


Arrival Rate Leaf Node System Throughput Operator Server Average Response Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    H. Boral, W. Alexander, L. Clay, G. Copeland, S. Danforth, M. Franklin, B. Hart, M. Smith, and P. Valduriez. Prototyping Bubba, a highly parallel database system. IEEE Trans. on Knowledge and Data Engineering, 2(1):4–24, 1990.CrossRefGoogle Scholar
  2. 2.
    Chandra Chekuri, Waqar Hasan, and Rajeev MotWani. Scheduling problems in parallel query optimization. In Proc. of the 14th ACM Symposium on Principles of Database Systems, pages 255–265, San Jose, California, May 1995.Google Scholar
  3. 3.
    Ming-Syan Chen, Mingling Lo, Philip S. Yu, and Honesty C. Young. Using segmented right-deep trees for the execution of pipelined hash joins. In Proc. of Int'l Conf. on VLDB, August 1992. 15–26.Google Scholar
  4. 4.
    D. J. DeWitt, S. Ghandeharizadeh, D. A. Schneider, A. Bricker, H.-I Hsiao, and R. Rasmussen. The Gamma database machine project. IEEE Trans. on Knowledge and Data Engineering, 2(1):44–62, 1990.CrossRefGoogle Scholar
  5. 5.
    Wei Hong and Michael Stonebraker. Optimization of parallel query execution plans in XPRS. In Proc. of Int'l Conf. on Parallel and Distributed Information Systems, pages 218–225, December 1991.Google Scholar
  6. 6.
    M. Kitsuregawa, H. Tanaka, and T. Moto-oka. Application of hash to database machine and its architecture. New Generation Computing, 1(1):66–74, 1983.Google Scholar
  7. 7.
    Hongjun Lu, Ming-Chien Shan, and Kian-Lee Tan. Optimization of multi-way join queries for parallel execution. In Proc. of the 17th Int'l Conf. on VLDB, pages 549–560, Barcelona, Spain, September 1991.Google Scholar
  8. 8.
    Yu lung Lo, Kien A. Hua, and Wallapak Tavanapong. Scheduling queries for parallel execution on multicomputer database management systems. Technical Report CS-TR-96-03, Department of Computer Science, University of Central Florida, March 1996.Google Scholar
  9. 9.
    D. A. Schneider and D. J. DeWitt. Tradeoffs in processing complex join queries via hashing in multiprocessor database machine. In Proc. of the 16th VLDB Conf., pages 469–480, Brisbane, Australia, 1990.Google Scholar
  10. 10.
    M. Stonebraker. The design of XPRS. In Proc. of the 14th Int'l Conf. on VLDB, pages 318–330, Los Angeles, August 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Yu-lung Lo
    • 1
  • Kien A. Hua
    • 1
  • Wallapak Tavanapong
    • 1
  1. 1.Department of Computer ScienceUniversity of Central FloridaOrlandoUSA

Personalised recommendations