Skip to main content
SpringerLink
Log in

Middleware Support for Precise Failure Semantics

  • Living reference work entry
  • First Online:
Encyclopedia of Database Systems

  • 44 Accesses

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 via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Frølund S, Guerraoui R. Implementing e-transactions with asynchronous replication. IEEE Trans Parallel Distrib Syst. 2001;12(2):133–46.

    Article  Google Scholar 

  2. Frølund S, Guerraoui R. X-ability: a theory of replication. Distrib Comput. 2001;14(4):231–49.

    Article  MATH  Google Scholar 

  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.

    Article  Google Scholar 

  4. Herlihy M, Wing JM. Linearizability: a correctness condition for concurrent objects. ACM Trans Program Lang Syst. 1990;12(3):463–92.

    Article  Google Scholar 

  5. Papadimitriou CH. The serializability of concurrent database updates. J ACM. 1979;26(4):631–53.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, INRIA, Saint-Ismier Cedex, France

    Vivien Quéma

Authors
  1. Vivien Quéma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vivien Quéma .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, Georgia, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, Ontario, Canada

    M. Tamer Özsu

Section Editor information

  1. Dept. of Elec. and Comp. Eng., Univ. of Toronto, 10 King's College Rd., M5S 3G4, Toronto, ON, Canada

    Cristiana Amza

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Quéma, V. (2016). Middleware Support for Precise Failure Semantics. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_1544-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_1544-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation