A concurrency control theory for nested transactions (Preliminary Report)

Concurrency control is the activity of synchronizing transactions that access shared data. A concurrency control algorithm is regarded as correct if it ensures that any interleaved execution of transactions is equivalent to a serial one. Such executions are called serializable. Serializability theory provides a method for modelling and analyzing the correctness of concurrency control algorithms [BSW, Pa]. The concept of nested transaction has recently received much attention [GR], [Mo]. In a nested transaction model, each transaction can invoke sub- transactions, which can invoke sub-subtransactions, and so on. The natural modelling concept is the tree log. The leaves of a tree log are atomic operations executed by the underlying system. Internal nodes are operations (as seen by their parents) implemented as transactions (as seen by their children). Nodes are related by a partial order <, where x<y means x executes before y [La].

[1]  Philip A. Bernstein,et al.  Formal Aspects of Serializability in Database Concurrency Control , 1979, IEEE Transactions on Software Engineering.

[2]  S. B. Yao,et al.  Efficient locking for concurrent operations on B-trees , 1981, TODS.

[3]  Derick Wood,et al.  A New Method for Concurrency in B-Trees , 1982, IEEE Transactions on Software Engineering.

[4]  Nancy A. Lynch,et al.  Global States of a Distributed System , 1982, IEEE Transactions on Software Engineering.

[5]  Abraham Silberschatz,et al.  Consistency in Hierarchical Database Systems , 1980, JACM.

[6]  Philip A. Bernstein,et al.  A Sophisticate's Introduction to Distributed Concurrency Control (Invited Paper) , 1982, VLDB.

[7]  Daniel J. Rosenkrantz,et al.  Distributed database concurrency controls using before-values , 1981, SIGMOD '81.

[8]  Philip A. Bernstein,et al.  Categories and Subject Descriptors: H.2.4 [Database Management]: Systems. , 2022 .

[9]  Daniel J. Rosenkrantz,et al.  System level concurrency control for distributed database systems , 1978, TODS.

[10]  Nancy A. Lynch,et al.  Concurrency control for resilient nested transactions , 1983, PODS '83.

[11]  Philip A. Bernstein,et al.  Concurrency Control in Distributed Database Systems , 1986, CSUR.

[12]  Christos H. Papadimitriou,et al.  The serializability of concurrent database updates , 1979, JACM.

[13]  Alfred Z. Spector,et al.  Synchronizing shared abstract types , 1984, TOCS.

[14]  Rudolf Bayer,et al.  Parallelism and recovery in database systems , 1980, TODS.

[15]  Deborah DuBourdieux,et al.  Implementation of Distributed Transactions , 1982, Berkeley Workshop.

[16]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[17]  Stephen Fox,et al.  The implementation of an integrated concurrency control and recovery scheme , 1982, SIGMOD '82.

[18]  David P. Reed,et al.  Naming and synchronization in a decentralized computer system , 1978 .

[19]  Philip A. Bernstein,et al.  Site Initialization, Recovery, and Backup in a Distributed Database System , 1984, IEEE Transactions on Software Engineering.

[20]  William E. Weihl,et al.  Specification and implementation of resilient, atomic data types , 1983, ACM SIGPLAN Notices.

[21]  Philip A. Bernstein,et al.  A SOPHISTICATE'S'INTRODUCTION TO DISTRIBUTED DATABASE CONCURRENCY CONTROL , 1982 .

[22]  Christos H. Papadimitriou,et al.  On concurrency control by multiple versions , 1982 .

[23]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[24]  E. B. Moss,et al.  Nested Transactions: An Approach to Reliable Distributed Computing , 1985 .

[25]  C. H. Papadimitriou.  SERIALIZABILITY OF CONCURRENT DATA BASE UPDATES , 1979 .