skip to main content
10.1145/1352793.1352813acmconferencesArticle/Chapter ViewAbstractPublication PagesicuimcConference Proceedingsconference-collections
research-article

Optimistic transactional active replication

Published:31 January 2008Publication History

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

  1. J. Lyon, Design Considerations in Replicated Database Systems for Disaster Protection, IEEE Compcon, 1988.Google ScholarGoogle Scholar
  2. F. Pedone, R. Guerraoui, and A. Schiper, The database state machine approach, Journal of Distributed and Parallel Databases and Technology, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. F. B. Schneider, Implementing Fault-Tolerant Services Using the State Machine Approach: A tutorial, ACM Computing Surveys (CSUR), Vol.22 No.4, pp.299--319, 1990 Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.Google ScholarGoogle Scholar
  5. S. Fr'ulund and R. Guerraoui, Implementing E-Transactions with Asynchronous Replication, IEEE Trans. on Parallel and Distributed Systems, Vol.12, No.2, Feb.2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. F. Cristian, Understanding Fault-Tolerant Distributed Systems, Communications of the ACM, Vol. 34, No.2, pp. 56--78, Feb, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. X. Defago, A. Schiper and P. Urban, Total Order Broadcast and Multicast Algorithms: Taxonomy and Survey, ACM Computing Surveys, ACM Press, Vol. 36, No. 4, pp. 372--421, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. W. Zhao, L. E. Mose, and P. M. Melliar-Smith, Unification of Transactions and Replication in Three-Tier Architectures Based on CORBA, IEEE Trans. on Dependable and Secure Computing, Vol. 2, No. 1, 2005 Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R. Ladin, B. Liskov, L. Shrira, and S. Ghemawat, Lazy Replication, Exploiting the Semantics of Distributed Services, Procs. of the 9th annual ACM Symposium on Principles of Distributed Computing, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. R. Ladin, Providing High Availability Using Lazy Replication, ACM Transactions on Computer Systems, Vol. 10, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Gray and A. Reuter, Transaction Processing Concepts and techniques, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Y. Breitbart and H. F. Korth, Replication and Consistency: Being Lazy Helps Sometimes, PODS' 97 Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. T. Anderson, Y. Breitbart, H. F. Korth, and A. Wool, Replication, Consistency, and Practicality: Are These Mutually Exclusive?, Proc. of ACM SIGMOD International Conference on Management of Data, pp. 484--495, June 1998 Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. P. Felber, A. Schiper, Optimistic Active Replication, Procs. of the 21st International Conference on Distributed ComputingGoogle ScholarGoogle Scholar
  15. B. Kemme, F. Pedoney, G. Alonso, and A. Schiper, Processing Transactions over Optimistic Atomic Broadcast Protocols, Procs. of the 19th IEEE International Conference on Distributed Computing Systems, pp. 424--431, 1999 Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. B. Kemme and G. Alonso, A New Approach to Developing and Implementing Eager Database Replication Protocols, ACM Trans on Database Systems, Vol. 25 No. 3, pp. 333--379, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Optimistic transactional active replication

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      ICUIMC '08: Proceedings of the 2nd international conference on Ubiquitous information management and communication
      January 2008
      604 pages
      ISBN:9781595939937
      DOI:10.1145/1352793

      Copyright © 2008 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 31 January 2008

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate251of941submissions,27%
    • Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader