Redo Recovery after System Crashes

: This paper defines a framework for explaining redo recovery after a system crash. In this framework, an installation graph explains the order in which operations must be installed into the stable database if it is to remain recoverable. This installation graph is a significantly weaker ordering on operations than the conflict graph from concurrency control. We use the installation graph to devise (i) a cache management algorithm for writing data from the volatilecache tothe stabledatabase, (ii)the specification of a REDO test used to choose the operations on the log to replay during recovery, and (iii) an idempotent recovery algorithm based on this test; and we prove that these cache management and recovery algorithms are correct. Most pragmatic recovery methods depend on constraining the kinds of operations that can appear in the log, but our framework allows arbitrary logged operations. We use our framework to explain pragmatic methods that constrain the logged operations to re...

• Type: Conference
• Year: 1995
• Where: VLDB
• Authors: David B. Lomet, Mark R. Tuttle
• Keywords: Database, Installation Graph, Logged Operations, Redo Recovery, VLDB 1995