Effective Resource Utilization for Multiprocessor Join Execution.

Marguerite C. Murphy, Doron Rotem: Effective Resource Utilization for Multiprocessor Join Execution. VLDB 1989: 67-75
  author    = {Marguerite C. Murphy and
               Doron Rotem},
  editor    = {Peter M. G. Apers and
               Gio Wiederhold},
  title     = {Effective Resource Utilization for Multiprocessor Join Execution},
  booktitle = {Proceedings of the Fifteenth International Conference on Very
               Large Data Bases, August 22-25, 1989, Amsterdam, The Netherlands},
  publisher = {Morgan Kaufmann},
  year      = {1989},
  isbn      = {1-55860-101-5},
  pages     = {67-75},
  ee        = {db/conf/vldb/MurphyR89.html},
  crossref  = {DBLP:conf/vldb/89},
  bibsource = {DBLP,}


Conventional approaches to execution of database queries on general purpose multiprocessors attempt to maximize system throughput using inter-query parallelism with a fixed number of processors. Standard uniprocessor optimization techniques are used to minimize execution time of individual queries. Our approach is to increase performance by utilizing intra-query parallelism as well as minimizing overall resource requirements. Specifically, processor and tio bandwidth requirements are minimized by coordinating the order in which data pages are read into memory and pagejoins assigned to available processors. We present a scheduling strategy based on join indices and prove lower and upper bounds on its resource requirements. We then describe a heuristic for estimating the number of processors required to complete join execution in minimal time. Our simulation results indicate that these techniques are effective with respect to processor utilization and buffer requirements.

Copyright © 1989 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Peter M. G. Apers, Gio Wiederhold (Eds.): Proceedings of the Fifteenth International Conference on Very Large Data Bases, August 22-25, 1989, Amsterdam, The Netherlands. Morgan Kaufmann 1989, ISBN 1-55860-101-5


Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
Pankaj Goyal, H. F. Li, E. Regener, Fereidoon Sadri: Scheduling of Page Fetches in Join Operations Using Bc-Trees. ICDE 1988: 304-310 BibTeX
T. H. Merrett, Yahiko Kambayashi, H. Yasuura: Scheduling of Page-Fetches in Join Operations. VLDB 1981: 488-498 BibTeX
Marguerite C. Murphy, Doron Rotem: Processor Scheduling for Multiprocessor Joins. ICDE 1989: 140-148 BibTeX
Stephen K. Park, Keith W. Miller: Random Number Generators: Good Ones Are Hard to Find. Commun. ACM 31(10): 1192-1201(1988) BibTeX
Patrick Valduriez: Join Indices. ACM Trans. Database Syst. 12(2): 218-246(1987) BibTeX

Referenced by

  1. Chiang Lee, Zue-An Chang: Utilizing Page-Level Join Index for Optimization in Parallel Join Execution. IEEE Trans. Knowl. Data Eng. 7(6): 900-914(1995)
  2. Marguerite C. Murphy, Doron Rotem: Multiprocessor Join Scheduling. IEEE Trans. Knowl. Data Eng. 5(2): 322-338(1993)
  3. Chiang Lee, Zue-An Chang: Workload Balance and Page Access Scheduling For Parallel Joins In Shared-Nothing Systems. ICDE 1993: 411-418
  4. Priti Mishra, Margaret H. Eich: Join Processing in Relational Databases. ACM Comput. Surv. 24(1): 63-113(1992)
  5. Edward Omiecinski: Performance Analysis of a Load Balancing Hash-Join Algorithm for a Shared Memory Multiprocessor. VLDB 1991: 375-385
  6. Doron Rotem: Spatial Join Indices. ICDE 1991: 500-509
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
VLDB Proceedings: Copyright © by VLDB Endowment,
ACM SIGMOD Anthology: Copyright © by ACM (, Corrections:
DBLP: Copyright © by Michael Ley (, last change: Sat May 16 23:45:40 2009