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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
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.
The lifetime of a saga begins when the saga is initiated, and ends when the saga terminates (commits or aborts).
It is possible that in H s e one part of a saga Si is in H s r and the other part of S i is in H s e — H s r .
This may happen because T in may have already been covered or inverted.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Liu, P., Jajodia, S. (2002). Trusted Recovery by Rewriting Histories. In: Trusted Recovery and Defensive Information Warfare. Advances in Information Security, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6880-0_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6880-0_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4926-4
Online ISBN: 978-1-4757-6880-0
eBook Packages: Springer Book Archive