Multi-level recovery

  • Authors:

  • Gerhard Weikum;Christof Hasse;Peter Broessler;Peter Muth

  • Affiliations:

  • ETH Zurich, Computer Science Dept. Database Research Group, CH-8092 Zurich, Switzerland;ETH Zurich, Computer Science Dept. Database Research Group, CH-8092 Zurich, Switzerland;University of Bremen, Computer Science Dept., PO. Box 330440, D-2800 Bremen 33, West Germany;GMD Integrated Publication and Information Systems Institute (IPSI), Dolivostr. 15, D-6100 Darmstadt, West Germany

  • Venue:
  • PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multi-level transactions have received considerable attention as a framework for high-performance concurrency control methods. An inherent property of multi-level transactions is the need for compensating actions, since state-based recovery methods do no longer work correctly for transaction undo. The resulting requirement of operation logging adds to the complexity of crash recovery. In addition, multi-level recovery algorithms have to take into account that high-level actions are not necessarily atomic, e.g., if multiple pages are updated in a single action.In this paper, we present a recovery algorithm for multi-level transactions. Unlike typical commercial database systems, we have striven for simplicity rather than employing special tricks. It is important to note, though, that simplicity is not achieved at the expense of performance. We show how a high-performance multi-level recovery algorithm can be systematically developed based on few fundamental principles. The presented algorithm has been implemented in the DASDBS database kernel system.