Electronic Resource
Springer
International journal of parallel programming
14 (1985), S. 387-403
ISSN:
1573-7640
Keywords:
Database
;
transaction
;
concurrency
;
serializability
;
families of schedules
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract Concurrent execution of database transactions is desirable from the point of view of speed, but may introduce inconsistencies. A commonly used criterion of correctness of a concurrent execution of transactions is serializability, i.e., the equivalence of the execution to some serial schedule or schedules. In the literature several transaction models have been used and several different notions of serializability have been introduced. In this paper, we investigate the various serializability families in the general transaction model, in the two-step model, and in the restricted two-step model. We also examine these families in the multiversion database model.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00991181
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |