Advertisement

Trusted Recovery by Rewriting Histories

  • Peng Liu
  • Sushil Jajodia
Part of the Advances in Information Security book series (ADIS, volume 4)

Abstract

This chapter presents the semantic aspect of the proposed trusted recovery scheme where a set of rewriting algorithms is developed and substantial transaction semantics is incorporated to save the work of more good transactions.

Keywords

Serial History Compensation Approach Read Information Transaction Class Saga Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 1.
    We adapt the notation of commutativity from [Lynch et al., 1994; Weihl, 1988]. Transaction T2 commutes backward through transaction T1 if for any state s on which T1T2 is defined, T2(T1 (s)) = Tl(T2(s)); T1 and T2 commute if each commutes backward through the other. Note that one-sided commutativity (i.e., commutes backward through) is enough for our purpose.Google Scholar
  2. 2.
    The lifetime of a saga begins when the saga is initiated, and ends when the saga terminates (commits or aborts).Google Scholar
  3. 3.
    It is possible that in H es one part of a saga Si is in Hrs and the other part of S i is in H esH rs.Google Scholar
  4. 4.
    This may happen because Tin may have already been covered or inverted.Google Scholar

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Peng Liu
    • 1
  • Sushil Jajodia
    • 2
    • 3
  1. 1.Department of Information SystemsUniversity of MarylandBaltimore CountyUSA
  2. 2.Center for Secure Information SystemsGeorge Mason UniversityUSA
  3. 3.Department of Information & Software EngineeringGeorge Mason UniversityFairfaxUSA

Personalised recommendations