|
|
|
     |
                                     |
Return to Formal Foundations
Our goal is to understand redo recovery. We define an installation graph of operations in an execution, an ordering significantly weaker than conflict ordering from concurrency control. The installation graph explains recoverable system state in terms of which operations are considered installed. This explanation and the set of operations replayed during recovery form an invariant that is the contract between normal operation and recovery. It prescribes how to coordinate changes to system components such as the state, the log, and the cache. We also describe how widely used recovery techniques are modeled in our theory, and why they succeed in providing redo recovery.
@inproceedings {DBLP:conf/sigmod/LometT03, author = {David B. Lomet and Mark R. Tuttle}, booktitle = {SIGMOD Conference}, title = {A Theory of Redo Recovery.}, pages = {397-406}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#LometT03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r15p01.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
