Optimistic transactional active replication

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Optimistic transactional active replication

Full text

Pdf (473 KB)

Source

Conference On Ubiquitous Information Management And Communication archive
Proceedings of the 2nd international conference on Ubiquitous information management and communication table of contents

Suwon, Korea

SESSION: Database table of contents

Pages 94-100

Year of Publication: 2008

ISBN:978-1-59593-993-7

Authors

Hiroshi Horii	Waseda University, Tokyo, Japan
Hayato Yamana	Waseda University, Tokyo, Japan

Sponsors

SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 57, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1352793.1352813 What is a DOI?

ABSTRACT

Critical database applications require 2-safe replication between at least two sites for disaster-tolerant services. At the same time, they must provide consistent and low-latency results to their clients in normal cases. In this paper, we propose Optimistic Transactional Active Replication (OTAR), which replicates the transaction logs with low latency and provides a consistent view to database applications. The latency of our replication is lower than Passive Replication, and guarantees the serializability of transaction isolation levels that cannot be supported by Active Replication. For our replication, each client sends a transaction request to all replicas and all of the replicas execute the request and optimistically return the result of the transaction to the client. Each replica generates a causality history of the transaction, sent to the client with the result. With the causality histories, the client can make sure that the requested transaction was executed in the same order at all of the replicas and eventually commit it. If the client cannot validate the order, then the client waits for the pessimistic result of the transaction from the replicas. This paper describes the algorithm and its properties.

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	J. Lyon, Design Considerations in Replicated Database Systems for Disaster Protection, IEEE Compcon, 1988.
	2	Fernando Pedone , Rachid Guerraoui , André Schiper, The Database State Machine Approach, Distributed and Parallel Databases, v.14 n.1, p.71-98, July 2003 [doi>10.1023/A:1022887812188]
	3	Fred B. Schneider, Implementing fault-tolerant services using the state machine approach: a tutorial, ACM Computing Surveys (CSUR), v.22 n.4, p.299-319, Dec. 1990 [doi>10.1145/98163.98167]
	4	K. Hu, S. Mehrotra, and S. Kaplan, An Optimized Two-Safe Approach to Maintain Remote Backup Systems, Procs. of Conference on Management of Data, 1997.
	5	Svend Frølund , Rachid Guerraoui, Implementing E-Transactions with Asynchronous Replication, IEEE Transactions on Parallel and Distributed Systems, v.12 n.2, p.133-146, February 2001 [doi>10.1109/71.910869]
	6	Flavin Cristian, Understanding fault-tolerant distributed systems, Communications of the ACM, v.34 n.2, p.56-78, Feb. 1991 [doi>10.1145/102792.102801]
	7	Xavier Défago , André Schiper , Péter Urbán, Total order broadcast and multicast algorithms: Taxonomy and survey, ACM Computing Surveys (CSUR), v.36 n.4, p.372-421, December 2004 [doi>10.1145/1041680.1041682]
	8	Wenbing Zhao , Louise E. Moser , P. Michael Melliar-Smith, Unification of Transactions and Replication in Three-Tier Architectures Based on CORBA, IEEE Transactions on Dependable and Secure Computing, v.2 n.1, p.20-33, January 2005 [doi>10.1109/TDSC.2005.14]
	9	Rivka Ladin , Barbara Liskov , Liuba Shrira, Lazy replication: exploiting the semantics of distributed services, Proceedings of the ninth annual ACM symposium on Principles of distributed computing, p.43-57, August 22-24, 1990, Quebec City, Quebec, Canada [doi>10.1145/93385.93399]
	10	Rivka Ladin , Barbara Liskov , Liuba Shrira , Sanjay Ghemawat, Providing high availability using lazy replication, ACM Transactions on Computer Systems (TOCS), v.10 n.4, p.360-391, Nov. 1992 [doi>10.1145/138873.138877]
	11	Jim Gray , Andreas Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1992
	12	Yuri Breitbart , Henry F. Korth, Replication and consistency: being lazy helps sometimes, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.173-184, May 11-15, 1997, Tucson, Arizona, United States [doi>10.1145/263661.263681]
	13	Todd Anderson , Yuri Breitbart , Henry F. Korth , Avishai Wool, Replication, consistency, and practicality: are these mutually exclusive?, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.484-495, June 01-04, 1998, Seattle, Washington, United States
	14	P. Felber, A. Schiper, Optimistic Active Replication, Procs. of the 21st International Conference on Distributed Computing
	15	Processing Transactions over Optimistic Atomic Broadcast Protocols, Proceedings of the 19th IEEE International Conference on Distributed Computing Systems, p.424, May 31-June 04, 1999
	16	Bettina Kemme , Gustavo Alonso, A new approach to developing and implementing eager database replication protocols, ACM Transactions on Database Systems (TODS), v.25 n.3, p.333-379, Sept. 2000 [doi>10.1145/363951.363955]
	17	B. Kemme, F. Pedone, G. Alonso, and A. Schiper, Using Optimistic Atomic Broadcast in Transaction Processing Systems, IEEE Trans. on Knowledge and Data Engineering, Vol. 15, No. 4, 2003.