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
Introduction to the theory of nested transactions
Proceedings on International conference on database theory
Nested transactions and read-write locking
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Extending Multiversion Time-Stamping Protocols to Exploit Type Information
IEEE Transactions on Computers
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Maintaining availability in partitioned replicated databases
ACM Transactions on Database Systems (TODS)
Commutativity-based locking for nested transactions
Journal of Computer and System Sciences
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Achieving robustness in distributed database 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
Implementing atomic actions on decentralized data
ACM Transactions on Computer Systems (TOCS)
A Theory of Timestamp-Based Concurrency Control for Nested Transactions
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
REPLICATION METHODS FOR ABSTRACT DATA TYPES
REPLICATION METHODS FOR ABSTRACT DATA TYPES
A One-Phase Algorithm to Detect Distributed Deadlocks in Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
On the Correctnes of Virtual Partition Algorithm in a Nested Transaction Environment
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
Gifford's Quorum Consensus algorithm for data replication is studied in the context of nested transactions and transaction failures (aborts), and a fully developed reconfiguration strategy is presented. A formal description of the algorithm is presented using the Input/Output automaton model for nested-transaction systems due to Lynch and Merritt. In this description, the algorithm itself is described in terms of nested transactions. The formal description is used to construct a complete proof of correctness that uses standard assertional techniques, is based on a natural correctness condition, and takes advantage of modularity that arises from describing the algorithm as nested transactions. The proof is accomplished hierarchically, showing that a fully replicated reconfigurable system “simulates” an intermediate replicated system, and that the intermediate system simulates an unreplicated system. The presentation and proof treat issues of data replication entirely separately from issues of concurrency control and recovery.