Abstract A Recovery Algorithm for A High-Performance Memory-Resident Database System

Wrth memory prrces droppmg and memory slaes m-creasmg accordrngly, a number of researchers are ad-dressmg the problem of desrgnmg hrgh-performance database systems for managing memory-restdent data In thus paper we address the recovery problem m the context of such a system We argue that exrstmg database recovery schemes fall short of meetmg the re-qmrements of such a system, and we present a new re-covery mechamsm whrch IS designed to overcome therr shortcommgs The proposed mechamsm takes advan-tage of a few megabytes of rehable memory m order to orgamae recovery mformatron on a per “obJect ” basrs As a result, It IS able to amortme the cost of check-pomts over a controllable number of updates, and rt IS also able to separate post-crash recovery mto two phases-hrgh-speed recovery of data whrch IS needed rmmedrately by transacttons, and background recov-ery of the remammg portions of the database A turn-ple performance analysrs IS undertaken, and the results suggest our mechamsm should perform well m a hrgh-performance, memory-resrdent database envrronment