1991Unpublished venueRequires access

Making progress in cooperative transaction models

Gail E. Kaiser, Dewayne E. Perry

Open publisher page 3 citations

Abstract

In the classical transaction model, transactions are consistency preserving units: a transaction is made up of a series of actions which, when executed in isolation in a reliable environment, transforms the database from one consistent state to another [2]. A classical transaction management system guarantees the appearance of isolation and reliability, even though multiple transactions execute concurrently and hardware and software components fail. It does this by enforcing atomicity and serializability: atomicity means that either an entire transaction apparently executes to completion or not at all, while serializability means that the effects of the transactions are viewed as if the transactions had executed in some serial order, one completing before the next begins. This is accomplished by considering the objects read and written by concurrently executing transactions, and ensuring that either all updates are completed or none are, and that the read and write dependencies among the set of transactions correspond to some serial order of the transactions. There have been many proposals for extending the transaction model from its original data processing applications to software development, CAD/CAM and other forms of cooperative work. The notion of ‘‘transaction’ ’ is intuitively appealing in these domains, since forward progress often depends on making a related set of changes to a program, design or document in such a way that it is transformed from one

About this research paper

What this paper is about

In the classical transaction model, transactions are consistency preserving units: a transaction is made up of a series of actions which, when executed in isolation in a reliable environment, transforms the database from one consistent state to another [2]. A classical transaction management system guarantees the appearance of isolation and reliability, even though multiple transactions execute concurrently and hardware and software components fail. It does this by enforcing atomicity and serializability: atomicity means that either an entire transaction apparently executes to completion or not at all, while serializability means that the effects of the transactions are viewed as if the transactions had executed in some serial order, one completing before the next begins. This is accomplished by considering the objects read and written by concurrently executing transactions, and ensuring that either all updates are completed or none are, and that the read and write dependencies among the set of transactions correspond to some serial order of the transactions. There have been many proposals for extending the transaction model from its original data processing applications to software development, CAD/CAM and other forms of cooperative work. The notion of ‘‘transaction’ ’ is intuitively appealing in these domains, since forward progress often depends on making a related set of changes to a program, design or document in such a way that it is transformed from one

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In the classical transaction model, transactions are consistency preserving units: a transaction is made up of a series of actions which, when executed in isolation in a reliable environment, transforms the database from one consistent state to another [2]. A classical transaction management system guarantees the appearance of isolation and reliability, even though multiple transactions execute concurrently and hardware and software components fail. It does this by enforcing atomicity and serializability: atomicity means that either an entire transaction apparently executes to completion or not at all, while serializability means that the effects of the transactions are viewed as if the transactions had executed in some serial order, one completing before the next begins. This is accomplished by considering the objects read and written by concurrently executing transactions, and ensuring that either all updates are completed or none are, and that the read and write dependencies among the set of transactions correspond to some serial order of the transactions. There have been many proposals for extending the transaction model from its original data processing applications to software development, CAD/CAM and other forms of cooperative work. The notion of ‘‘transaction’ ’ is intuitively appealing in these domains, since forward progress often depends on making a related set of changes to a program, design or document in such a way that it is transformed from one

Key concepts: Atomicity, Serializability, Computer science, Two-phase locking, Distributed transaction, Database transaction, Compensating transaction, Isolation (microbiology)

Related papers

Back to paper searchBrowse research topicsOriginal source
Making progress in cooperative transaction models — Research Paper | ScholarLens