Nested transactions: an approach to reliable distributed computing
Nested transactions: an approach to reliable distributed computing
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Availability in partitioned replicated databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Nested transactions and read-write locking
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Introduction to the theory of nested transactions
Theoretical Computer Science - First International Conference on Database Theory, Rome, September 1986
Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Precision locking for nested transaction systems
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Quorum consensus in nested-transaction systems
ACM Transactions on Database Systems (TODS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
An efficient, fault-tolerant protocol for replicated data management
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
In this paper, we model the virtual partition algorithm in a nested transaction environment using I/O automaton model. The formal description is used to construct a complete correctness proof that is based on standard assertional techniques and on a natural correctness condition, and takes advantage of modularity that arises from describing the algorithm as nested transactions. Our presentation and proof treat issues of data replication entirely separately from issues of concurrency control. Moreover, we have identified that virtual partition algorithm can not be proven correct in the sense of Goldman's work [7] on Gifford's Quorum Consensus Algorithm using the serializability theorem defined by Fekete et al.[4]. Thus, we have stated a weaker notion of correctness conditions, which we call reorder serializability theorem.