Correctness and Parallelism in Composite Systems

Title Correctness and Parallelism in Composite Systems
Author(s) G. Alonso, S. Blott, A. Fessler, H.-J. Schek
Type inproceedings
Booktitle Proc. of the 16th Symp. on Principles of Database Systems (PODS'97)
Tucson, Arizona
Organization Institute of Information Systems, ETH Zürich
Month May
Year 1997


In recent years, databases have started to be used as intelligent repositories for a variety of semantically-richer systems. A consequence of such architectures is that transaction scheduling takes place throughout composite systems consisting of layered subsystems. Such transaction architectures have been studied extensively. Existing theory, however, limits the degree of parallelism, and makes a number of simplifying assumptions which cannot be taken for granted in practice. This paper proposes a new model and correctness criterion, stack conflict consistency, for composite transactional systems. The main contribution of the new model is to establish the correctness conditions under which higher degrees of parallelism can be achieved between operations of the same transaction, as well as between conflicting operations of different transactions, in a uniform way. This possibility, although hinted at previously, has not yet been exploited in practical composite systems. Hence, we hope to improve the practical impact of many key results in this area.
!!! Dieses Dokument stammt aus dem ETH Web-Archiv und wird nicht mehr gepflegt !!!
!!! This document is stored in the ETH Web archive and is no longer maintained !!!