A Recovery Scheme for Database Systems with Large Main Memory

Abstract

The availability of large, relatively inexpensive main memories would enable the advent of future database systems that have all the data in main memory. The challenge in the design of such systems is to provide fast transaction processing by dilferent access methods and query optimization strategies, and to provide more efficient concurrency control and a rapid restart after a failure. In this paper a recovery scheme for main memory database systems is presented. It achieves non-interference and a fast restart through incremental checkpointing and log compression. Other issues in main memory database systems are addressed, and alternatives in restart logic are discussed. Note: Abstract extracted from PDF file via OCR