A Generalized Transaction Theory for Database and Non-database Tasks

  • Armin Feßler
  • Hans-Jörg Schek
Conference paper

DOI: 10.1007/3-540-48311-X_62

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1685)
Cite this paper as:
Feßler A., Schek HJ. (1999) A Generalized Transaction Theory for Database and Non-database Tasks. In: Amestoy P. et al. (eds) Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg

Abstract

In both database transaction management and parallel programming, parallel execution of operations is one of the most essential features. Although they look quite different, we will show that many important similarities exist. As a result of a more careful comparison we will be able to point out that recent progress in database transaction management theory in the field of composite stack schedules can improve the degree of parallelism in databases as well as in parallel programming. We will use an example from numerical algorithms and will demonstrate that in principle more parallelism can be achieved.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Armin Feßler
    • 1
  • Hans-Jörg Schek
    • 1
  1. 1.Institute of Information SystemsZürichSwitzerland

Personalised recommendations