Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
1993 | 10.1145/962393 | CASCON |
Field | DocType | Citations |
Atomicity,Interdependence,Serializability,Computer science,Real-time computing,Weak consistency,Merge (version control),Distributed computing | Conference | 0 |
PageRank | References | Authors |
0.34 | 9 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Barry J. Brachman | 1 | 11 | 3.27 |
Gerald Neufeld | 2 | 394 | 80.81 |