Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
A database cache for high performance and fast restart in database systems
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
ACM Transactions on Database Systems (TODS)
Recovery mechanisms in database systems
Recovery mechanisms in database systems
Logical logging to extend recovery to new domains
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
The Recovery Manager of the System R Database Manager
ACM Computing Surveys (CSUR)
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Model and Verification of a Data Manager Based on ARIES
ICDT '92 Proceedings of the 4th International Conference on Database Theory
Persistent Applications Using Generalized Redo Recovery
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Redo Recovery after System Crashes
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Fault-tolerance in the Borealis distributed stream processing system
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Using model checking to find serious file system errors
ACM Transactions on Computer Systems (TOCS)
Fault-tolerance in the borealis distributed stream processing system
ACM Transactions on Database Systems (TODS)
Implementing performance competitive logical recovery
Proceedings of the VLDB Endowment
A survey of B-tree logging and recovery techniques
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
RapiLog: reducing system complexity through verification
Proceedings of the 8th ACM European Conference on Computer Systems
Hi-index | 0.00 |
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.