Parallel relational database systems: Why, how and beyond

  • A. Hameurlain
  • F. Morvan
Invited Talk
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1134)


This paper aims to describe synthetically integration and use of parallelism in relational databases on MIMD parallel architecture models. More precisely, after exposing the main goals of parallel relational databases, we highlight that it is essential to exploit recent parallel architectures to obtain high performance. Parallelization of database programs requires the use of data placement approaches and data partitioning strategies which lead to extract levels, forms and types of parallelism. As for the inter-operation parallelization phase, the key problem of optimization, we describe one-phase and two-phase inter-operation parallelization strategies. This leads to unsolved problems which constitute a challenge for future parallel relational database systems.


Parallel Architecture Parallelization Strategy Query Tree Multiprocessor Architecture Distribute Information System 
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.
    F. Andrès et al., “A Multi-Environment Cost Evaluator for Parallel Database Systems”, 2nd Intl. Symp. on Database Systems for Advanced Applications, DASFAA'91, Tokyo, April 1991Google Scholar
  2. 2.
    C. Baru et al., “An Overview of DB2 Parallel Edition”, Proc. ACM SIGMOD Conf. on Management of Data, San Jose, May 1995, CA, pp. 460–462.Google Scholar
  3. 3.
    B. Bergstein et al., “Prototyping DBS3, a Shared Memory Parallel Database System”, First Int. Conf. on Parallel and Distributed Information Systems, Miami, pp. 226–234, 1991.Google Scholar
  4. 4.
    H. Boral et al., “Prototyping Bubba, a Highly Parallel Database System”, IEEE Trans. Knowledge and Data Engineering. Vol. 1, No.1, March 1990, pp. 4–24.CrossRefGoogle Scholar
  5. 5.
    F. Cariño, P. Kostamaa, “Exegesis of DBC/1012 and P-90 — Industrial Supercomputer Database Machines”, 4th Intl. PARLE Conf., Paris, June 1992, pp. 877–892.Google Scholar
  6. 6.
    C. Chachaty et al., “A Compositional Approach for the Design of a Parallel Query Processing Language”, 4th Int. PARLE Conf., LNCS, Paris, June 1992, pp. 825–840.Google Scholar
  7. 7.
    C. Chekuri, et al., “Scheduling Problem in Parallel Query Optimization”, Symposium in Principles of Database Systems, PODS'95, 1995.Google Scholar
  8. 8.
    M.S Chen, et al., “Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins”, Proceedings of the 18th Intl. VLDB conf., Vancouver, August, 1992, pp. 15–26.Google Scholar
  9. 9.
    R.W. Conway, et al., “The Theory of Scheduling”, Addition-Wesley, 1967.Google Scholar
  10. 10.
    G. Copeland et al., “Data Placement in Bubba”, Proc. ACM SIGMOD Conf. on Management of Data, Chicago, May 1988, pp. 99–108.Google Scholar
  11. 11.
    E. Dahlhaus, et al., “Complexity of Multiway Cuts”, 24th Annual ACM Symposium on the Theory of Computing, 1992, pp. 241–251.Google Scholar
  12. 12.
    D.J. Dewitt et al., “The Gamma Database Machine Project”, IEEE Trans. Knowledge and Data Engineering. Vol. 2, No. 1, March, 1990, pp. 44–61.CrossRefGoogle Scholar
  13. 13.
    D.J. Dewitt, J. Gray, “Parallel Database Systems: The future of High Performance Database Systems”, Communication of the ACM, Vol. 35, No. 6, June 1992, pp. 85–98.CrossRefGoogle Scholar
  14. 14.
    S. Englert, et al. “Parallelism and its Price: A Case Study of NonStop SQL/MP' SIGMOD Record, Vol. 24, No. 4, Dec. 1995.Google Scholar
  15. 15.
    F.T. Fleighton,” Introduction aux algorithmes et architectures parallèles”, Traduction de P. Fraigniaud et E. Fleury, Morgan and Kaufmann Publisher, Inc. 1995.Google Scholar
  16. 16.
    M.J. Flynn, “Some Computer Organisation and their Effectivenesses”, IEEE Trans. Computers, C-21, pp. 948–960, September 1972.Google Scholar
  17. 17.
    C. Germain-Renaud, J.P. Sansonnet, “Les ordinateurs massivement parallèles ” Ed. Armand Colin, Paris, 1991.Google Scholar
  18. 18.
    S. Ghandeharizadeh, D.J. Dewitt, “Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines”, Proc. of the 16th Intl. Conf. onVLDB, Brisbane, 1990, pp. 481–492.Google Scholar
  19. 19.
    A. Hameurlain et al., “An Analytical Method to Allocate Processors in High Performance Parallel Execution of Recursive Queries”, Intl. Conf. DEXA92, Valencia, 1992, pp. 44–47.Google Scholar
  20. 20.
    A. Hameurlain, F. Morvan, “A Parallel Scheduling Method for Efficient Query Processing”, 22nd Intl. Conf. on Parallel Processing, St. Charles, Chicago IL. August 16–20, 1993, Vol. 3, pp. 258–261Google Scholar
  21. 21.
    A. Hameurlain, F. Morvan, “An Optimization Method of Data Communication and Control for Parallel Execution of SQL Queries”, Intl. Conf. DEXA'93, LNCS 720, Prague, 1993, pp. 301–312.Google Scholar
  22. 22.
    A. Hameurlain, F. Morvan, “A Cost Evaluator for Parallel Database Systems”, 6th Intl. Conf. on Database and Expert Systems Applications, DEXA'95, London, 4–8 Sept. 1995, LNCS 978, pp. 146–156.Google Scholar
  23. 23.
    A. Hameurlain, F. Morvan, “Scheduling and Mapping for Parallel Execution of Extended SQL Queries”, 4th Intl. Conf. on Information and Knowledge Management, ACM Press, Baltimore, Maryland, 28 Nov.–2 Dec. 1995, pp. 197–204.Google Scholar
  24. 24.
    W. Hasan, R. Motwani, “Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism”, Proc. of the 20th Intl. Conf. on VLDB, Santiago, Sept. 1994.Google Scholar
  25. 25.
    W. Hasan, R. Motwani, “Coloring Away Communication in Parallel Query Optimization”, Proc. of the 21th Intl. Conf. on VLDB, Zurich, Switerland, Sept. 1995.Google Scholar
  26. 26.
    W. Hong, “Exploiting Inter-Operation Parallelism in XPRS”, ACM SIGMOD Intl. Conf. on Management of Data, USA, June 1992, pp. 19–28.Google Scholar
  27. 27.
    K. A. Hua, et al. “Interconnecting Shared-Everything Systems for Efficient Parallel Query Processing”, First Intl. Conf. on Parallel Distributed Information Systems, Dec. 1991 Florida, USA, pp. 262–270.Google Scholar
  28. 28.
    Y.E. Ioannidis, Y. Cha Kong, “Randomized Algorithms for Optimizing Large Join Queries”, Proc. of the 1990 ACM SIGMOD Conf. on the Manag. of Data, Atlantic City, May 1990, pp. 312–321.Google Scholar
  29. 29.
    J.L. Jacquemin, “Informatique parallèle et systèmes multiprocesseurs”, Ed. Hermes, Hermes, Paris, 1993.Google Scholar
  30. 30.
    R.S.G Lanzelotte, P. Valduriez, “Extending the Search Strategy in a Query Optimizer”, Proc. of the 17th International Conf. on VLDB, Barcelona,1991, pp. 363–373.Google Scholar
  31. 31.
    R.S.G. Lanzelotte, et al., “On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces”, Proc. of the 17th Intl. Conf. on VLDB, Dublin, 1993, pp. 413–504.Google Scholar
  32. 32.
    M. Livny et al, “Multi-Disk Management”, ACM Sigmetrics Conf. on Measurement and Modeling of Computer Systems, Banff Alberta, May 1987, pp. 69–77.Google Scholar
  33. 33.
    H. Lu, et al. “Query Processing in Parallel Relational Database Systems”, IEEE Computer Society Press, 1994.Google Scholar
  34. 34.
    J. P. Richardson, et al., “Design and Evaluation of Parallel Pipelined Join Algorithms”, Proc. ACM SIGMOD Conf. on Management of Data, New York, 1987, pp. 399–409.Google Scholar
  35. 35.
    D. Schneider, D. Dewitt, “Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines”, Proc. of the 16th VLDB Conf., Brisbane, Australia 1990, pp. 469–480.Google Scholar
  36. 36.
    M. Stonebraker, et. al, “The Design of XPRS”, Proceedings of the14 th VLDB Conf., 1988.Google Scholar
  37. 37.
    A. Swami, “Optimization of Large Join Queries: Combining Heuristics an Combinatorial Techniques”, Proc. of the 1989 ACM-SIGMOD Conf. on Management of Data, Portland, USA, Vol. 18, No. 2, 1989, pp. 367–376.Google Scholar
  38. 38.
    K.L. Tan, H. Lu, “A Note on the Strategy Space of Multiway Join Query Optimization Problem in Parallel Systems”, SIGMOD Record, Vol. 20, No. 4, December 1991, pp. 81–82.CrossRefGoogle Scholar
  39. 39.
    K.L. Tan, H. Lu, “Pipeline Processing of Multi-Way Join Queries in Shared-Memory Systems”, 22nd Intl. Conf. on Parallel Processing, St. Charles, Chicago IL. August 16–20, 1993, Vol. 1, pp. 345–348.Google Scholar
  40. 40.
    P. Valduriez, “Parallel Database Systems: Open Problems and News Issues”, Distributed and parallel Databases, Kluwer Academic Publishers, Vol. 1, No. 2, 1993, pp. 137–165.Google Scholar
  41. 41.
    Witkowski A., “NCR 3700 the Next-Generation Industrial Database Computer”, Proc. of the 19th VLDB Conf., Dublin, Ireland, 1993, pp. 230–243.Google Scholar
  42. 42.
    M. Ziane, et al. “Parallel Query Processing in DBS3”, 2nd International Conference on Parallel and Distributed Information Systems, San Diego, USA, January 22–24, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • A. Hameurlain
    • 1
  • F. Morvan
    • 1
  1. 1.Lab. IRITUniversité Paul SabatierToulouseFrance

Personalised recommendations