1 CSE232A: Database System Principles Notes 08: Failure Recovery.

Slides:



Advertisements
Similar presentations
1 CS411 Database Systems 12: Recovery obama and eric schmidt sysadmin song
Advertisements

Recovery Amol Deshpande CMSC424.
ICS 214A: Database Management Systems Fall 2002
Crash Recovery John Ortiz. Lecture 22Crash Recovery2 Review: The ACID properties  Atomicity: All actions in the transaction happen, or none happens 
1 CPS216: Data-intensive Computing Systems Failure Recovery Shivnath Babu.
CS 245Notes 081 CS 245: Database System Principles Notes 08: Failure Recovery Hector Garcia-Molina.
Chapter 20: Recovery. 421B: Database Systems - Recovery 2 Failure Types q Transaction Failures: local recovery q System Failure: Global recovery I Main.
1 Failure Recovery Checkpointing Undo/Redo Logging Source: slides by Hector Garcia-Molina.
Transactions A process that reads or modifies the DB is called a transaction. It is a unit of execution of database operations. Basic JDBC transaction.
Cs44321 CS4432: Database Systems II Lecture #19 Database Consistency and Transactions Professor Elke A. Rundensteiner.
Recovery from Crashes. Transactions A process that reads or modifies the DB is called a transaction. It is a unit of execution of database operations.
Crash Recovery. Review: The ACID properties A A tomicity: All actions in the Xaction happen, or none happen. C C onsistency: If each Xaction is consistent,
Recovery from Crashes. ACID A transaction is atomic -- all or none property. If it executes partly, an invalid state is likely to result. A transaction,
1 ICS 214A: Database Management Systems Fall 2002 Lecture 16: Crash Recovery Professor Chen Li.
ACID A transaction is atomic -- all or none property. If it executes partly, an invalid state is likely to result. A transaction, may change the DB from.
1 Failure Recovery Introduction Undo Logging Redo Logging Source: slides by Hector Garcia-Molina.
CS 277 – Spring 2002Notes 081 CS 277: Database System Implementation Notes 08: Failure Recovery Arthur Keller.
1 Θεμελίωση Βάσεων Δεδομένων Notes 09: Failure Recovery Βασίλης Βασσάλος.
Cs4432recovery1 CS4432: Database Systems II Database Consistency and Violations?
1 Anna Östlin Pagh and Rasmus Pagh IT University of Copenhagen Advanced Database Technology March 25, 2004 SYSTEM FAILURES Lecture based on [GUW ,
Cs4432recovery1 CS4432: Database Systems II Lecture #19 Database Consistency and Violations? Professor Elke A. Rundensteiner.
Cs4432recovery1 CS4432: Database Systems II Lecture #20 Failure Recovery Professor Elke A. Rundensteiner.
1 Implementing Atomicity and Durability Chapter 25.
CS 245Notes 081 CS 245: Database System Principles Notes 08: Failure Recovery Hector Garcia-Molina.
©Silberschatz, Korth and Sudarshan17.1Database System Concepts 3 rd Edition Chapter 17: Recovery System Failure Classification Storage Structure Recovery.
July 16, 2015ICS 5411 Coping With System Failure Chapter 17 of GUW.
1 Recovery Control (Chapter 17) Redo Logging CS4432: Database Systems II.
1 CPS216: Advanced Database Systems Notes 10: Failure Recovery Shivnath Babu.
Chapter 171 Chapter 17: Coping with System Failures (Slides by Hector Garcia-Molina,
HANDLING FAILURES. Warning This is a first draft I welcome your corrections.
Chapter 15 Recovery. Topics in this Chapter Transactions Transaction Recovery System Recovery Media Recovery Two-Phase Commit SQL Facilities.
CMPT 454, Simon Fraser University, Fall 2009, Martin Ester 294 Database Systems II Coping With System Failures.
DBMS 2001Notes 7: Crash Recovery1 Principles of Database Management Systems 7: Crash Recovery Pekka Kilpeläinen (after Stanford CS245 slide originals.
1 How can several users access and update the information at the same time? Real world results Model Database system Physical database Database management.
Chapter 16 Recovery Yonsei University 1 st Semester, 2015 Sanghyun Park.
Chapter 10 Recovery System. ACID Properties  Atomicity. Either all operations of the transaction are properly reflected in the database or none are.
Carnegie Mellon Carnegie Mellon Univ. Dept. of Computer Science Database Applications C. Faloutsos Recovery.
Chapter 17: Recovery System
Transactional Recovery and Checkpoints. Difference How is this different from schedule recovery? It is the details to implementing schedule recovery –It.
1 Ullman et al. : Database System Principles Notes 08: Failure Recovery.
1 Lecture 28: Recovery Friday, December 5 th, 2003.
03/30/2005Yan Huang - CSCI5330 Database Implementation – Recovery Recovery.
1 Lecture 15: Data Storage, Recovery Monday, February 13, 2006.
Database Recovery Zheng (Godric) Gu. Transaction Concept Storage Structure Failure Classification Log-Based Recovery Deferred Database Modification Immediate.
CS422 Principles of Database Systems Failure Recovery Chengyu Sun California State University, Los Angeles.
Jun-Ki Min. Slide Purpose of Database Recovery ◦ To bring the database into the last consistent stat e, which existed prior to the failure. ◦
1 Advanced Database Systems: DBS CB, 2 nd Edition Recovery Ch. 17.
DURABILITY OF TRANSACTIONS AND CRASH RECOVERY
CS422 Principles of Database Systems Failure Recovery
Implementing Atomicity and Durability
Recovery Control (Chapter 17)
Advanced Database Systems: DBS CB, 2nd Edition
Recovery 6/4/2018.
CS4432: Database Systems II
File Processing : Recovery
Database System Principles Notes 08: Failure Recovery
CS 245: Database System Principles Notes 08: Failure Recovery
CPSC-608 Database Systems
CS 245: Database System Principles Notes 08: Failure Recovery
Lecture 28 Friday, December 7, 2001.
Recovery System.
Transaction Management Overview
Introduction to Database Systems CSE 444 Lectures 15-16: Recovery
Database Recovery 1 Purpose of Database Recovery
CPSC-608 Database Systems
CPSC-608 Database Systems
CPSC-608 Database Systems
Data-intensive Computing Systems Failure Recovery
Lecture 17: Data Storage and Recovery
Lecture 16: Recovery Friday, November 4, 2005.
Presentation transcript:

1 CSE232A: Database System Principles Notes 08: Failure Recovery

2 Integrity or correctness of data Would like data to be “accurate” or “correct” at all times EMP Name White Green Gray Age

3 Integrity or consistency constraints Predicates data must satisfy Examples: - x is key of relation R - x  y holds in R - Domain(x) = {Red, Blue, Green}  is valid index for attribute x of R - no employee should make more than twice the average salary

4 Definition: Consistent state: satisfies all constraints Consistent DB: DB in consistent state

5 Constraints ( as we use here) may not capture “full correctness” Example 1 Transaction constraints When salary is updated, new salary > old salary When account record is deleted, balance = 0

6 Note: could be “emulated” by simple constraints, e.g., account Acct #….balancedeleted?

7 Example 2 Database should reflect real world DB Reality Constraints ( as we use here) may not capture “full correctness”

8  in any case, continue with constraints... Observation: DB cannot be consistent always! Example: a 1 + a 2 +…. a n = TOT ( constraint ) Deposit $100 in a 2 : a 2  a TOT  TOT + 100

9 a 2 TOT Example: a 1 + a 2 +…. a n = TOT ( constraint ) Deposit $100 in a 2 : a 2  a TOT  TOT + 100

10 Transaction: collection of actions that preserve consistency Consistent DBConsistent DB’ T

11 Big assumption: If T starts with consistent state + T executes in isolation  T leaves consistent state

12 Correctness (informally) If we stop running transactions, DB left consistent Each transaction sees a consistent DB

13 How can constraints be violated? Transaction bug DBMS bug Hardware failure e.g., disk crash alters balance of account Data sharing e.g.: T1: give 10% raise to programmers T2: change programmers  systems analysts

14 How can we prevent/fix violations? Chapter 8: due to failures only Chapter 9: due to data sharing only Chapter 10: due to failures and sharing

15 Will not consider: How to write correct transactions How to write correct DBMS Constraint checking & repair That is, solutions studied here do not need to know constraints

16 Chapter 8Recovery First order of business: Failure Model

17 Events Desired Undesired Expected Unexpected

18 Our failure model processor memory disk CPU M D

19 Desired events: see product manuals…. Undesired expected events: System crash - memory lost - cpu halts, resets Undesired Unexpected: Everything else! that’s it!!

20 Examples: Disk data is lost Memory lost without CPU halt CPU implodes wiping out universe…. Undesired Unexpected: Everything else!

21 Is this model reasonable? Approach: Add low level checks + redundancy to increase probability model holds E.g., Replicate disk storage (stable store) Memory parity CPU checks

22 Second order of business: Storage hierarchy Memory Disk x x

23 Operations: Input (x): block with x  memory Output (x): block with x  disk Read (x,t): do input(x) if necessary t  value of x in block Write (x,t): do input(x) if necessary value of x in block  t

24 Key problem Unfinished transaction ExampleConstraint: A=B T 1 : A  A  2 B  B  2

25 T 1 :Read (A,t); t  t  2 Write (A,t); Read (B,t); t  t  2 Write (B,t); Output (A); Output (B); A: 8 B: 8 A: 8 B: 8 memory disk 16 failure!

26 Need atomicity: execute all actions of a transaction or none at all

27 One solution: undo logging (immediate modification) due to: Hansel and Gretel, 782 AD Improved in 784 AD to durable undo logging

28 T 1 :Read (A,t); t  t  2 A=B Write (A,t); Read (B,t); t  t  2 Write (B,t); Output (A); Output (B); A:8 B:8 A:8 B:8 memory disk log Undo logging (Immediate modification)

29 One “complication” Log is first written in memory Not written to disk on every action memory DB Log A: 8 16 B: 8 16 Log: A: 8 B: 8 16 BAD STATE # 1

30 One “complication” Log is first written in memory Not written to disk on every action memory DB Log A: 8 16 B: 8 16 Log: A: 8 B: 8 16 BAD STATE # 2...

31 Undo logging rules (1) For every action generate undo log record (containing old value) (2) Before x is modified on disk, log records pertaining to x must be on disk (write ahead logging: WAL) (3) Before commit is flushed to log, all writes of transaction must be reflected on disk

32 Recovery rules: Undo logging For every Ti with in log: - If or in log, do nothing - Else For all in log: write (X, v) output (X ) Write to log  IS THIS CORRECT??

33 Recovery rules: Undo logging (1) Let S = set of transactions with in log, but no (or ) record in log (2) For each in log, in reverse order (latest  earliest) do: - if Ti  S then - write (X, v) - output (X) (3) For each Ti  S do - write to log

34 What if failure during recovery? No problem!  Undo idempotent

35 To discuss: Redo logging Undo/redo logging, why both? Real world actions Checkpoints Media failures

36 Redo logging (deferred modification) T 1: Read(A,t); t t  2; write (A,t); Read(B,t); t t  2; write (B,t); Output(A); Output(B) A: 8 B: 8 A: 8 B: 8 memory DB LOG 16 output 16

37 Redo logging rules (1) For every action, generate redo log record (containing new value) (2) Before X is modified on disk (DB), all log records for transaction that modified X (including commit) must be on disk (3) Flush log at commit

38 For every Ti with in log: –For all in log: Write(X, v) Output(X) Recovery rules: Redo logging  IS THIS CORRECT??

39 (1) Let S = set of transactions with in log (2) For each in log, in forward order (earliest  latest) do: - if Ti  S then Write(X, v) Output(X) optional Recovery rules: Redo logging

40 Recovery is very, very SLOW ! Redo log: FirstT1 wrote A,BLast RecordCommitted a year agoRecord (1 year ago)--> STILL, Need to redo after crash!!... Crash

41 Solution: Checkpoint (simple version) Periodically: (1) Do not accept new transactions (2) Wait until all transactions finish (3) Flush all log records to disk (log) (4) Flush all buffers to disk (DB) (do not discard buffers) (5) Write “checkpoint” record on disk (log) (6) Resume transaction processing

42 Example: what to do at recovery? Redo log (disk): Checkpoint Crash...

43 Key drawbacks: Undo logging: cannot bring backup DB copies up to date Redo logging: need to keep all modified blocks inmemory until commit

44 Solution: undo/redo logging! Update  page X

45 Rules Page X can be flushed before or after Ti commit Log record flushed before corresponding updated page (WAL) Flush at commit (log only)

46 Non-quiesce checkpoint L O G for undodirty buffer pool pages flushed Start-ckpt active TR: Ti,T2,... end ckpt...

47 Examples what to do at recovery time? no T1 commit L O G T 1,- a... Ckpt T 1... Ckpt end... T1-bT1-b  Undo T 1 (undo a,b)

48 Example LOGLOG... T1aT1a T1bT1b T1cT1c T 1 cmt... ckpt- end ckpt-s T 1  Redo T1: (redo b,c)

49 Recovery process: Backwards pass (end of log  latest checkpoint start) –construct set S of committed transactions –undo actions of transactions not in S Undo pending transactions –follow undo chains for transactions in (checkpoint active list) - S Forward pass (latest checkpoint start  end of log) –redo actions of S transactions backward pass forward pass start check- point

50 Real world actions E.g., dispense cash at ATM Ti = a 1 a 2 …... a j …... a n $

51 Solution (1) execute real-world actions after commit (2) try to make idempotent

52 ATM Give$$ (amt, Tid, time) $ give(amt) lastTid: time:

53 Media failure (loss of non-volatile storage) A: 16 Solution: Make copies of data!

54 Example 1 Triple modular redundancy Keep 3 copies on separate disks Output(X) --> three outputs Input(X) --> three inputs + vote X1X2 X3

55 Example #2 Redundant writes, Single reads Keep N copies on separate disks Output(X) --> N outputs Input(X) --> Input one copy - if ok, done - else try another one  Assumes bad data can be detected

56 Example #3: DB Dump + Log backup database active database log If active database is lost, – restore active database from backup – bring up-to-date using redo entries in log

57 When can log be discarded? check- point db dump last needed undo not needed for media recovery not needed for undo after system failure not needed for redo after system failure log time

58 Summary Consistency of data One source of problems: failures - Logging - Redundancy Another source of problems: Data Sharing..... next