Encyclopedia of Database Systems

Living Edition
| Editors: Ling Liu, M. Tamer Özsu

Middleware Support for Precise Failure Semantics

Living reference work entry
DOI: https://doi.org/10.1007/978-1-4899-7993-3_1544-2

Definition

Providing support for precise failure semantics requires defining an appropriate correctness criterion for replicated action execution of a replication algorithm. Such a correctness criterion allows formally verifying that a sequence of actions is executed correctly. In the context of replication, a sequence of actions executed is correctly if their side-effect appears to have happened exactly-once.

Historical Background

Reasoning about the behavior of concurrent programs has been an active research area during the past decades. Of particular interest in this area are the works on linearizability, a consistency criterion for concurrent objects [4], and on serializability, a consistency criterion for concurrent transactions [5]. These two criteria facilitate certain kinds of formal reasoning by transforming assertions about complex concurrent behavior into assertions about simpler sequential behavior. Moreover, these consistency criteria are local properties: the correctness...

This is a preview of subscription content, log in to check access

Recommended Reading

  1. 1.
    Frølund S, Guerraoui R. Implementing e-transactions with asynchronous replication. IEEE Trans Parallel Distrib Syst. 2001;12(2):133–46.CrossRefGoogle Scholar
  2. 2.
    Frølund S, Guerraoui R. X-ability: a theory of replication. Distrib Comput. 2001;14(4):231–49.CrossRefMATHGoogle Scholar
  3. 3.
    Frølund S, Guerraoui R. e-Transactions: end-to-end reliability for three-tier architectures. IEEE Trans Software Eng. 2002;28(4):378–95.CrossRefGoogle Scholar
  4. 4.
    Herlihy M, Wing JM. Linearizability: a correctness condition for concurrent objects. ACM Trans Program Lang Syst. 1990;12(3):463–92.CrossRefGoogle Scholar
  5. 5.
    Papadimitriou CH. The serializability of concurrent database updates. J ACM. 1979;26(4):631–53.MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.CNRS, INRIASaint-Ismier CedexFrance