Instant recovery with write-ahead logging

Instant recovery improves system availability by reducing the mean time to repair, i.e., the interval during which a database is not available for queries and updates due to recovery activities. Variants of instant recovery pertain to system failures, media failures, node failures, and combinations of multiple failures. After a system failure, instant restart permits new transactions immediately after log analysis, before and concurrent to “redo” and “undo” recovery actions. After a media failure, instant restore permits new transactions immediately after allocation of a replacement device, before and concurrent to restoring backups and replaying the recovery log.Write-ahead logging is already ubiquitous in data management software. The recent definition of single-page failures and techniques for log-based single-page recovery enable immediate, lossless repair after a localized wear-out in novel or traditional storage hardware. In addition, they form the backbone of on-demand “redo” in instant restart, instant restore, and eventually instant failover. Thus, they complement on-demand invocation of traditional single-transaction “undo” or rollback.In addition to these instant recovery techniques, the discussion introduces self-repairing indexes and much faster offline restore operations, which impose no slowdown in backup operations and hardly any slowdown in log archiving operations. The new restore techniques also render differential and incremental backups obsolete, complete backup commands on a database server practically instantly, and even permit taking full up-to-date backups without imposing any load on the database server.

[1]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.

[2]  M. Tamer Özsu.  Synthesis Lectures on Data Management , 2010 .

[3]  Bernhard Seeger,et al.  Self-diagnosing and self-healing indexes , 2012, DBTest '12.

[4]  S. B. Yao,et al.  Efficient locking for concurrent operations on B-trees , 1981, TODS.

[5]  Michael J. Carey,et al.  A recovery algorithm for a high-performance memory-resident database system , 1987, SIGMOD '87.

[6]  C. Mohan,et al.  Disk read-write optimizations and data integrity in transaction systems using write-ahead logging , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[7]  Eliezer Levy.  Incremental Restart , 1991, ICDE 1991.

[8]  Goetz Graefe,et al.  Instant Recovery with Write-Ahead Logging: Page Repair, System Restart, and Media Restore , 2014, Synthesis Lectures on Data Management.

[9]  Goetz Graefe,et al.  Memory management during run generation in external sorting , 1998, SIGMOD '98.

[10]  Ismail Oukid,et al.  Instant Recovery for Main Memory Databases , 2015, CIDR.

[11]  Patrick E. O'Neil.  TheSB-tree an index-sequential structure for high-performance sequential access , 2005, Acta Informatica.

[12]  C. Mohan,et al.  A Cost-Effective Method for Providing Improved Data Availability During DBMS Restart Recovery After a Failure , 1993, VLDB.

[13]  Brian Randell,et al.  Operating Systems, An Advanced Course , 1978 .

[14]  Hamid Pirahesh,et al.  ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging , 1998 .

[15]  Goetz Graefe,et al.  Write-Optimized B-Trees , 2004, VLDB.

[16]  C. Mohan,et al.  ARIES/IM: an efficient and high concurrency index management method using write-ahead logging , 1992, SIGMOD '92.

[17]  Hamid Pirahesh,et al.  ARIES-RRH: restricted repeating of history in the ARIES transaction recovery method , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[18]  K. M. Chandy,et al.  Incremental Recovery In Main Memory Database Systems , 1992 .

[19]  C. Mohan.  Commit_LSN: A Novel and Simple Method for Reducing Locking and Latching in Transaction Processing Systems , 1996, Performance of Concurrency Control Mechanisms in Centralized Database Systems.

[20]  C. Mohan,et al.  ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes , 1990, VLDB.

[21]  Goetz Graefe,et al.  Foster b-trees , 2012, TODS.