ACM Home Page
Please provide us with feedback. Feedback
Revisiting 1-copy equivalence in clustered databases
Full text PdfPdf (82 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2006 ACM symposium on Applied computing table of contents
Dijon, France
SESSION: Dependable and adaptive distributed systems (DADS) table of contents
Pages: 728 - 732  
Year of Publication: 2006
ISBN:1-59593-108-2
Authors
Rui Oliveira  University of Minho
José Pereira  University of Minho
Afrânio Correia, Jr  University of Minho
Edward Archibald  Emic Networks
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 34,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1141277.1141442
What is a DOI?

ABSTRACT

Recently renewed interest in scalable database systems for shared nothing clusters has been supported by replication protocols based on group communication that are aimed at seamlessly extending the native consistency criteria of centralized database management systems. By using a read-one/write-all-available approach and avoiding the fine-grained synchronization associated with traditional distributed locking, one needs just a single distributed interaction step for each update transaction. Therefore the system can easily be scaled to a large number of replicas, especially, with read intensive loads typical of Web server support environments.In this paper we point out that 1-copy equivalence for causal consistency, which is subsumed by both serializability and snapshot isolation criteria, depends on basic session guarantees that are costly to ensure in clusters, especially in a multi-tier environment. We then point out a simple solution that guarantees causal consistency in the Database State Machine protocol and evaluate its performance, thus highlighting the cost of seamlessly providing common consistency criteria of centralized databases in a clustered environment.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
M. Ahamad, G. Neiger, P. Kohli, J. Burns, and P. Hutto. Causal memory: definitions, implementation and programming. Distributed Computing, 9(1), Sept. 1995.
3
 
4
J. Brzeziński, C. Sobaniec, and D. Wawrzyniak. From session causality to causal consistency. In Euromicro Conf. on Parallel, Distributed and Network-Based Processing, 2004.
 
5
6
 
7
A. Correia Jr., A. Sousa, L. Soares, J. Pereira, F. Moura, and R. Oliveira. Group-based replication of on-line transaction processing servers. In 2nd Latin-American Symposium on Dependable Computing, 2005.
 
8
 
9
10
 
11
12
 
13
 
14
 
15
 
16
 
17
T. P. P. C. (TPC). TPC Benchmark#8482; C standard specification revision 5.0, Feb. 2001.
 
18
 
19
 
20
V. Zuikeviciute and F. Pedone. Revisiting the database state machine approach. In VLDB Wks. on Design, Implementation and Deployment of Database Replication, 2005.


Collaborative Colleagues:
Rui Oliveira: colleagues
José Pereira: colleagues
Afrânio Correia, Jr: colleagues
Edward Archibald: colleagues