Lecture07 Recovery
Lecture07 Recovery
Crash Recovery
Log Checkpoint Recovery
Engineering Divsion, Penn State University Last Updated: November 17, 2004.
Atomicity: All actions in the Xact happen, or none happen. Consistency: If each Xact is consistent, and the DB starts
Isolation:
Xacts.
Execution of one Xact is isolated from that of other If a Xact commits, its effects persist.
Durability:
Motivation
Atomicity:
Transactions
Durability:
What
Desired Behavior after system restarts: T1, T2 & T3 should be durable. T4 & T5 should be aborted (effects not seen).
crash!
Assumptions
2PL, in particular.
No Steal Force
Steal
Trivial
No Force
Desired
STEAL (why enforcing Atomicity is hard) To steal frame F: Current page in F (say P) is written to disk; some Xact holds lock on P.
What
if the Xact with the lock on P aborts? Must remember the old value of P at steal time (to support UNDOing the write to page P).
NO FORCE (why enforcing Durability is hard) What if system crashes before a modified page is written to disk? Write as little as possible, in a convenient place, at commit time,to support REDOing modifications.
writes to log (put it on a separate disk). Minimal info (diff) written to log, so multiple updates fit in a single log page.
record contains: <XID, pageID, offset, length, old data, new data> and additional control info (which well see soon).
7
DB LSNs pageLSNs
RAM flushedLSN
Each log record has a unique Log Sequence Log records flushed to disk Number (LSN).
LSNs
always increasing.
LSN of the most recent log record for an update to that page.
pageLSN
Log Records
ENGINEERING DIVISION, PENN STATE UNIVERSITY
LogRecord fields:
prevLSN XID type pageID length offset before-image after-image
Possible log record types: Update Commit Abort End (signifies end of commit or abort) Compensation Log Records (CLRs)
for
UNDO actions
10
Transaction Table:
One
entry per active Xact. Contains XID, status (running/commited/aborted), and lastLSN.
entry per dirty page in buffer pool. Contains recLSN -- the LSN of the log record which first caused the page to be dirty.
11
In
Strict 2PL.
STEAL, NO-FORCE buffer management, with Write-
Ahead Logging.
12
Checkpointing
Periodically, the DBMS creates a checkpoint, in order to minimize the time taken to recover in the event of a system crash. Write to log:
begin_checkpoint
record: Indicates when chkpt began. end_checkpoint record: Contains current Xact table and dirty page table. This is a `fuzzy checkpoint:
Other
Xacts continue to run; so these tables accurate only as of the time of the begin_checkpoint record. No attempt to force dirty pages to disk; effectiveness of checkpoint limited by oldest unwritten change to a dirty page. (So its a good idea to periodically flush dirty pages to disk!)
Store
13
LOG LogRecords
prevLSN XID type pageID length offset before-image after-image
DB Data pages
each with a pageLSN
master record
flushedLSN
14
crash involved.
lastLSN of Xact from Xact table. Can follow chain of log records backward via the prevLSN field. Before starting UNDO, write an Abort log record.
For
Abort, cont.
ENGINEERING DIVISION, PENN STATE UNIVERSITY
No problem! You continue logging while you UNDO!! CLR has one extra field: undonextLSN
Points to the next LSN to undo (i.e. the prevLSN of the record were currently undoing).
CLRs never Undone (but they might be Redone when repeating history: guarantees Atomicity!)
16
Transaction Commit
ENGINEERING DIVISION, PENN STATE UNIVERSITY
Write commit record to log. All log records up to Xacts lastLSN are flushed.
that flushedLSN lastLSN. Note that log flushes are sequential, synchronous writes to disk. Many log records per log page.
Guarantees
17
Start from a checkpoint (found via master record). Three phases. Need to:
Figure out which Xacts committed since checkpoint, which failed (Analysis). REDO all actions. u (repeat history) UNDO effects of failed Xacts.
A R U
18
end_checkpoint record.
record: Remove Xact from Xact table. Other records: Add Xact to Xact table, set lastLSN=LSN, change Xact status on commit. Update record: If P not in Dirty Page Table, Add P to D.P.T., set its recLSN=LSN.
19
Scan forward from log rec containing smallest recLSN in D.P.T. For each CLR or update log rec LSN, REDO the action unless:
Affected page is not in the Dirty Page Table, or Affected page is in D.P.T., but has recLSN > LSN, or pageLSN (in DB) LSN.
To REDO an action:
Reapply logged action. Set pageLSN to LSN. No additional logging!
20
largest LSN among ToUndo. If this LSN is a CLR and undonextLSN==NULL Write an End record for this Xact. If this LSN is a CLR, and undonextLSN != NULL Add undonextLSN to ToUndo Else this LSN is an update. Undo the update, write a CLR, add prevLSN to ToUndo.
21
Example of Recovery
LSN
ENGINEERING DIVISION, PENN STATE UNIVERSITY
LOG
begin_checkpoint end_checkpoint update: T1 writes P5 update T2 writes P3 T1 abort CLR: Undo T1 LSN 10 T1 End update: T3 writes P1 update: T2 writes P5 CRASH, RESTART
22
RAM
Xact Table lastLSN status Dirty Page Table recLSN flushedLSN
00
05 10 20 30 40 45
prevLSNs
50
ToUndo
60
begin_checkpoint, end_checkpoint update: T1 writes P5 update T2 writes P3 T1 abort update: T3 writes P1 update: T2 writes P5 CRASH, RESTART
undonextLSN
LOG
RAM
40,45
50 60
ToUndo
70
80,85 90
What happens if system crashes during Analysis? During REDO? How do you limit the amount of work in REDO?
Flush
long-running Xacts.
24
Summary
ENGINEERING DIVISION, PENN STATE UNIVERSITY
Recovery Manager guarantees Atomicity & Durability. Use WAL to allow STEAL/NO-FORCE w/o sacrificing correctness. LSNs identify log records; linked into backwards chains per transaction (via prevLSN). pageLSN allows comparison of data page and log records.
25
Summary (Cont.)
ENGINEERING DIVISION, PENN STATE UNIVERSITY
Checkpointing: A quick way to limit the amount of log to scan on recovery. Recovery works in 3 phases:
Analysis:
Forward from checkpoint. Redo: Forward from oldest recLSN. Undo: Backward from end to first LSN of oldest Xact alive at crash.
Upon Undo, write CLRs. Redo repeats history: Simplifies the logic!
26
References
Lecture
ENGINEERING DIVISION, PENN STATE UNIVERSITY
notes based on Ramakrishnan, R. and Gehrke, J. (2003). Database Management Systems, Third Edition, McGraw-Hill, Boston, MA, pp. 579 602.
27