David Lomet
ABSTRACT
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.
- P. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley Publishing Company, Reading, MA, 1987. Google Scholar
Digital Library
- R. Crus. Data recovery in IBM Database 2. IBM Systems Journal, 23(2):178--188, 1984.Google ScholarDigital Library
- K. Elhardt and R. Bayer. A database cache for high performance and fast restart in database systems. ACM TODS, 9(4):503--525, December 1984. Google ScholarDigital Library
- J. Gray. Notes on database operating systems. In R. Bayer, R. Graham, and G. Seegmuller, editors, Operating Systems--An Advanced Course, volume 60 of Lecture Notes in Computer Science. Springer-Verlag, 1978. Also appears as IBM Research Report RJ 2188, 1978. Google ScholarDigital Library
- J. Gray, P. McJones, M. Blasgen, B. Lindsay, R. Lorie, T. Price, and F. Putzolu. The recovery manager of the System R database manager. ACM Computing Surveys, 13(2):223--242, June 1981. Google ScholarDigital Library
- J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, 1993. Google ScholarDigital Library
- T. Haerder and A. Reuter. Principles of transaction oriented database recovery--a taxonomy. ACM Computing Surveys, 15(4):287--318, December 1983. Google ScholarDigital Library
- V. Kumar, M. Hsu (eds). Recovery Mechanisms in Database Systems. Prentice Hall, 1998. Google ScholarDigital Library
- D. Kuo. Model and verification of a data manager based on ARIES. In ICDT 1992 231--245. Google ScholarDigital Library
- D. Lomet. Persistent Applications Using Generalized Redo Recovery. ICDE 1998 154--163. Google ScholarDigital Library
- D. Lomet. Advanced Recovery Techniques in Practice. in Recovery Mechanisms in Database Systems Prentice Hall, 1998Google Scholar
- D. Lomet and M. Tuttle. Redo recovery after system crashes. VLDB 1995 457--468 Google ScholarDigital Library
- D. Lomet and M. Tuttle. Logical Logging to Extend Recovery to New Domains. SIGMOD 1999 73--84. Google ScholarDigital Library
- C. Mohan, D. Haderle, B. Lindsay, H. Pirahesh, and P. Schwarz. ARIES: A transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. ACM TODS, 17(1):94--162, March 1992. Google ScholarDigital Library
Index Terms
- A theory of redo recovery
Recommendations
A Checkpointing Strategy and Redo Point Strategy for Embedded Real-Time Main Memory Databases Crash Recovery
CSIE '09: Proceedings of the 2009 WRI World Congress on Computer Science and Information Engineering - Volume 02In the embedded environment, the rapid and efficient recovery is needed in the event of the real-time main memory database system failures. Checkpointing strategy is very important for system recovery as one of the most important techniques of real-time ...
Comments