Nested transactions: an approach to reliable distributed computing
Nested transactions: an approach to reliable distributed computing
ACM Transactions on Database Systems (TODS)
Nested transactions and read-write locking
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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)
A theory of reliability in database systems
Journal of the ACM (JACM)
Serializability with constraints
ACM Transactions on Database Systems (TODS)
Transaction synchronisation in object bases
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Concurrent manipulation of binary search trees
ACM Transactions on Database Systems (TODS)
Semantically-based concurrancy control for search structures
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Concurrent operations on B-trees with overtaking
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
NESTED TRANSACTIONS: AN APPROACH TO RELIABLE DISTRIBUTED COMPUTING
NESTED TRANSACTIONS: AN APPROACH TO RELIABLE DISTRIBUTED COMPUTING
INTRODUCTION TO THE THEORY OF NESTED TRANSACTIONS
INTRODUCTION TO THE THEORY OF NESTED TRANSACTIONS
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Intensive Data Management in Parallel Systems: A Survey
Distributed and Parallel Databases
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Performance evaluation of linear hash structure model in a nested transaction environment
Journal of Systems and Software
Concurrency control and recovery for balanced B-link trees
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
This paper presents a concurrency control algorithm for nested transactions accessing B-trees. It combines the idea of B-link tree with that of resilient 2-phase locking [Mos85b]. The I/O automaton model is used in the specification and proofs of correctness of the system. We define “strongly-serially correct” schedules and use this property as our correctness criterion.