In quest of the bottleneck — monitoring parallel database systems

  • Stefan Manegold
  • Florian Waas
  • Daniel Gudlat
4 Tools
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1332)


Monitoring query processing has proven to be an effective technique to detect bottlenecks in sequential query execution systems' components. Monitoring distributed execution in parallel systems, however, is a difficult task. The monitoring data of all nodes must be collected at the same time to value load-balancing and scheduling. Furthermore, we want to extract not only information about resource allocation of single processes but also allow for monitoring of single tuples and attribute value distribution. The monitoring system we present in this paper is a client-server architecture where each process of the parallel database system is a client of the monitoring server. This architecture enables the user to monitor even load-balancing or scheduling effects. The monitoring extensions, each client is attached with, provide inspection of the processes at a fine granularity. Furthermore user-defined interpretation of monitoring data on the client side enables emulation of special parallel hardware by low costly components.


parallel and distributed database systems performance analysis 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. J. DeWitt and J. Gray. Parallel Database Systems: The Future of High Performance Database Systems. Communications of the ACM, 35(6), June 1992.Google Scholar
  2. 2.
    J. Gray. A Survey of Parallel Database Techniques and Systems. In Tutorial Handouts of the 21st Int'l. Conf. on Very Large Data Bases, Zurich, Switzerland, September 1995.Google Scholar
  3. 3.
    Jim Gray, editor. The Benchmark Handbook. Morgan Kaufmann, San Mateo, CA, USA, 2 edition, 1993.Google Scholar
  4. 4.
    H. Pirahesh, C. Mohan, J. Cheng, T. S. Liu, and P. Selinger. Parallelism in Relational Data Base Systems: Architectural Issues and Design Approaches. InProc. Int'l. Symp. on Databases in Parallel and Distr. Systems, Dublin, Ireland, July 1990.Google Scholar
  5. 5.
    D. A. Schneider and D. J DeWitt. A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment. In Proc. ACM SIGMOD Int'l. Conf, May 1989.Google Scholar
  6. 6.
    P. Valduriez. Parallel Database Systems: The Case for Shared-Something (Keynote Address). In Proc. IEEE Int'l. Conf. on Data Eng., Vienna, Austria, April 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Stefan Manegold
    • 1
  • Florian Waas
    • 2
  • Daniel Gudlat
    • 1
  1. 1.Humboldt-Universität zu BerlinInstitut für InformatikBerlinGermany
  2. 2.CWIGB AmsterdamThe Netherlands

Personalised recommendations