Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Parallelism and recovery in database systems
ACM Transactions on Database Systems (TODS)
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Consistency in Hierarchical Database Systems
Journal of the ACM (JACM)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Distributed database concurrency controls using before-values
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
The implementation of an integrated concurrency control and recovery scheme
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Concurrency control for resilient nested transactions
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
On concurrency control by multiple versions
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
A Sophisticate's Introduction to Distributed Concurrency Control (Invited Paper)
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
A theoretical foundation of multi-level concurrency control
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Abstraction in recovery management
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Nested transactions and read-write locking
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Architecture and implementation of the Darmstadt database kernel system
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Quorum consensus in nested transaction systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
Semantics based transaction management techniques for replicated data
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Commutativity-Based Concurrency Control for Abstract Data Types
IEEE Transactions on Computers
A model for concurrency in nested transactions systems
Journal of the ACM (JACM)
Local atomicity properties: modular concurrency control for abstract data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
The impact of recovery on concurrency control
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Performance evaluation of semantics-based multilevel concurrency control protocols
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Principles and realization strategies of multilevel transaction management
ACM Transactions on Database Systems (TODS)
Semantics-based concurrency control: beyond commutativity
ACM Transactions on Database Systems (TODS)
MLR: a recovery method for multi-level systems
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Transactional boosting: a methodology for highly-concurrent transactional objects
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hi-index | 0.01 |
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