Although how will the system recover, Database Management System

Assignment Help:

Although how will the system recover

The selection of REDO or UNDO for a transaction for the recovery is completed on the basis of the state of the transactions. This state is given in two steps:

  • Look into the log file and search all the transactions that have started. For instance, in Figure, transactions T1, T2 and T3 are applicants for recovery.
  • Search those transactions that have committed. REDO these transactions. All different transactions have not committed so they should be rolled back, so UNDO them. For instance, in Figure UNDO will be performed on T1 and T2; and REDO will be performed on T3.

Please note that in Figure some of the values may not have yet been communicated to database, yet we require to perform UNDO as we are not sure what values have been written back to the database.

Although how will the system recover? Once the recovery operation has been particular, the systems just takes the needed REDO or UNDO values from the transaction log and alters the inconsistent state of database to a consistent state.

Let us consider various transactions with their respective start & end (commit) times as shown in Figure.

                             2085_Although how will the system recover.png

                                               Figure: Execution of Concurrent Transactions

In the figure above four transactions are implementing simultaneously, on encountering a failure at time t2, and the transactions T1 and T2 are to be REDONE and T3 and T4 will be UNDONE. But take a system that has thousands of parallel transactions then every transaction that have been committed may have to be redone and every uncommitted transaction requires being undone. That is not a very good choice as it needs redoing of even those transactions that might have been committed even hours previous. So can we progress on this situation? Yes, we can take checkpoints. Figure shows a checkpoint mechanism:

                            2026_Although how will the system recover1.png

 

                                 Figure: Checkpoint In Transaction Execution

A checkpoint is taken at time t1 and a failure occurs at time t2.  Checkpoint transfers every committed change to database and all the system logs to stable storage (it is described as the storage that would not be lost). At restart time after the failure the stable check pointed state is restored. Therefore, we require to only REDO or UNDO those transactions that have done or started after the checkpoint has been taken. The only possible drawbacks of this scheme may be that during

the time of taking the checkpoint the database would not be available and some of the uncommitted values might be put in the physical database. To overcome the primary problem the checkpoints should be taken at times when system load is low. To avoid the second problem some systems permit some time to the ongoing transactions to complete without restarting new transactions.

In the case of Figure the recovery from failure at t2 will be as follows:

  • The transaction T1 will not be considered for recovery as the changes made by it have already been committed and transferred to physical database at checkpoint t1.
  • The transaction T2 since it has not committed till the checkpoint t1 except have committed before t2, will be REDONE.
  • T3 must be UNDONE as the changes made by it before checkpoint (we do not know for sure if any such changes were made prior to checkpoint) must have been communicated to the physical database. T3 must be restarted with a new name.
  • T4 begin after the checkpoint, and if we strictly follow the scheme in which the buffers are written back only on the checkpoint, then nothing required to be done except restarting the transaction T4 with a new name.

The restart of a transaction needs the log to keep information of the new name of the transaction and maybe give higher priority to this newer transaction.

But one question is still unanswered that is during a failure we lose database information in RAM buffers, we might also lose log as it may also be stored in RAM buffers, so how does log make sure recovery?

The answer to this question lies in the fact that for storing transaction log we follow a Write Ahead Log Protocol. As according to this protocol, the transaction logs are written to stable storage before any item is updated. Or more particularly it can be stated as; the undo potion of log is written to stable storage prior to some updates and redo portion of log is written to stable storage prior to commit.

Log based recovery scheme can be used for any kind of failure given you have stored the most recent checkpoint state and most recent log as per write ahead log protocol into the stable storage. Stable storage from the point of view of external failure needs more than one copy of such data at more than one location.


Related Discussions:- Although how will the system recover

Explain the concept of data mining, Question 1 Explain the concept of Fore...

Question 1 Explain the concept of Foreign Key. How a foreign key differs from a Primary Key? Can the Foreign Key accept nulls? Question 2 With a necessary example explain (i)

Which types of data supported by mysql, Which types of data supported by My...

Which types of data supported by MySQL for Time and Date formats?  MySQL supports a number of time and date column formats: Some of them are 1) DATE 2) DATETIME 3) TIM

Explain th process to avoid re-computation, Saving Derived Attributes to Av...

Saving Derived Attributes to Avoid Re-computation Data that is derived from other data should be stored in the computed form to avoid re-computation. For this, we could define

Explain the use of constraints in functional model, Explain the use of cons...

Explain the use of constraints in functional model with suitable example. A constraint shows relationship between two objects at same time, or   among various values of the sam

Explain heap file with advantages, Explain heap file with advantages? H...

Explain heap file with advantages? Heap File is an unordered set or a group of records, stored on a set of pages. This class gives basic support for inserting, updating, select

Architecture, With the help of a suitable diagram gives module wise explana...

With the help of a suitable diagram gives module wise explanation of system architecture of DBMS.on..

What is relational algebra, What is Relational Algebra? Relational algebr...

What is Relational Algebra? Relational algebra is a Procedural query Language?

What is meant by buffer blocks and disk buffer, What is meant by buffer blo...

What is meant by buffer blocks and disk buffer   The blocks residing temporarily in main memory are referred to as buffer blocks. The area of memory where blocks reside t

What is the function of a domain, What is the function of a Domain? A d...

What is the function of a Domain? A domain defines the technical settings of a table field. A domain describes a value range, which sets the permissible data values for the

Division operation, To do the division operation R1 ÷ R2, R2 should be a co...

To do the division operation R1 ÷ R2, R2 should be a correct subset of R1. In the following example R1 have attributes A and B and R2 have only attribute B so R2 is a correct subse

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd