Optimism and consistency in partitioned distributed database systems
ACM Transactions on Database Systems (TODS)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Designing a global name service
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Coda: A Highly Available File System for a Distributed Workstation Environment
IEEE Transactions on Computers
Providing high availability using lazy replication
ACM Transactions on Computer Systems (TOCS)
Disconnected operation in the Coda File System
ACM Transactions on Computer Systems (TOCS)
DISCONNECTED ACTIONS: AN ASYNCHRONOUS EXTENSION TO A NESTED ATOMIC ACTION SYSTEM
DISCONNECTED ACTIONS: AN ASYNCHRONOUS EXTENSION TO A NESTED ATOMIC ACTION SYSTEM
OPTIMISTIC CONCURRENCY CONTROL FOR NESTED DISTRIBUTED TRANSACTIONS
OPTIMISTIC CONCURRENCY CONTROL FOR NESTED DISTRIBUTED TRANSACTIONS
| Hi-index | 0.00 |
This paper describes the design of the weak consistency scheme used in ROSS, the EAN object store. ROSS supports nested atomic transactions on distributed and replicated objects. The weak consistency method falls into the family of optimistic protocols. After a partitioning, execution of transactions proceeds normally. If write-write conflicts are detected when partitions later merge, transactions may be rolled back to ensure consistency. One-copy serializability is not provided. This approach is particularly well suited to a common class of database applications where there is limited interdependency between objects. A distributed name service is one such application.