Log based recovery, Database Management System

Assignment Help:

Log based recovery:Let us first describe the term transaction log in the context of DBMS. A transaction log is a record in DBMS that remains track of all the transactions of a database system that update any data values in the database. A log haves the following information about a transaction:

  • A transaction start marker
  • The transaction identification: The transaction id, user id or terminal id etc.
  • The operations being performed by the transaction such as delete, update, insert.
  • The objects or data items that are affected by the transaction as well as name of the table, row number and column number.
  • The previous or before values (also known as UNDO values) and changed or after values (also called REDO values) of the data items that have been updated.
  • A pointer to the next transaction log record, if required.
  • The COMMIT marker of the transaction.

In a database system various transactions run simultaneously. When a transaction commits, the data buffers used by it require not be written back to the physical database stored on the secondary storage as these buffers may be used by various other transactions that have not yet committed.  On the other hand, some of the data buffers that may have updates by various uncommitted transactions may be forced back to the physical database, as they is no longer being used by the database.  So the transaction log helps in remembering which transaction did which alters.  Therefore the system knows exactly how to divide the changes made by transactions that have already committed from those alters that is made by the transactions that did not yet commit.  Any operation such as start transaction, insert /delete/update and end transaction (commit), adds information to the log having the transaction identifier and enough information to redo or undo the changes.

But how do we recover using log? Let us show this with the help of an example having three concurrent transactions that are active on ACCOUNTS table as:

 

Transaction T1

Transaction T2

Transaction T3

Read X

Read A

Read Z

Subtract 100

Add 200

Subtract 500

Write X

Write A

Write Z

Read Y

 

Add 100

Write Y

                                                Figure: The sample transactions

Suppose that these transactions have the following log file (hypothetical) at a point:

Transaction Begin Marker

Transaction

Id

Operation on ACCOUNTS table

UNDO values (assumed)

REDO

values

Transaction Commit Marker

Y

T1

Sub on X Add on Y

500

800

400

Not done yet

N

Y

T2

Add on A

1000

1200

N

Y

T3

Sub on Z

900

400

Y

                                 Figure: A sample (hypothetical) Transaction log

Now suppose at this point of time a failure occurs, then how the recovery of the database will be completed on restart.

Values

Initial

Just before the failure

Operation

Required for recovery

Recovered Database Values

X

500

400 (assuming update has been done in physical database also)

UNDO

500

Y

800

800

UNDO

800

A

1000

1000 (assuming update has not been done in physical database)

UNDO

1000

Z

900

900 (assuming update has not been done in physical database)

REDO

400

 


Related Discussions:- Log based recovery

Determine the persistent object, Determine the Persistent object Persis...

Determine the Persistent object Persistent object can be stored in one of the following: Files Cheap, permanent, simple storage Low level (Write, Read) Ap

1) Information about a bank is about customer, 1) Information a...

1) Information about a bank is about customers and their account. Customer has a name, address which consists of house number, area and city, and one or more phone numbers. Ac

What is functional dependency, What is Functional Dependency? A Functi...

What is Functional Dependency? A Functional dependency is shown by X Y among two sets of attributes X and Y that are subsets of R specifies a constraint on the possible tuple

Define and differentiate among ordered indexing and hashing, Define and dif...

Define and differentiate between ordered indexing and hashing. Ans: Ordered indexing: To gain fast random access to records in a file, we can make of an index structure. Every

Define the concept of design documentation, Design Documentation  The ...

Design Documentation  The Design Document shall be an extension of Requirements Analysis Design. "The Design Document will comprise a revised and much more detailed descrip

Complexity- drawbacks of data distribution, Complexity : A distributed DBMS...

Complexity : A distributed DBMS that is available, reliable, and secure is inherently more difficult than a centralised DBMS. Though, adequate data replication is essential to have

Which operator is used to compare a value to a list literals, Which operato...

Which operator is used to compare a value to a list of literals values that have been specified? BETWEEN operator is used to compare a value to a list of literals values that h

Drop table command, DROP TABLE Command: When an existing object is not ...

DROP TABLE Command: When an existing object is not needed for further use, it is always better to eliminate it from the database. To remove the existing object from the databas

Client server databases, Client Server Databases- The concept behind the C...

Client Server Databases- The concept behind the Client/Server systems is simultaneous, cooperative processing. It is an approach that presents a one systems view from a user's vie

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