Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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:
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
T2
Add on A
1000
1200
T3
Sub on Z
900
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
400 (assuming update has been done in physical database also)
UNDO
A
1000 (assuming update has not been done in physical database)
Z
900 (assuming update has not been done in physical database)
What are the two integrity rules? Ans: The two integrity rules are: Entity Integrity Rule & Referential Integrity Rule. Entity Integrity Rule - If the attribute A of rel
Multiple column Queries: Syntax: SELECT COLUMN1, COL2,...... FROM TABLE WHERE (COLUMN1, COL2, ...) IN (SELECT COLUMN1, COL2,.... FROM TABLE WHERE );
Explain the Object-oriented decomposition Object-oriented decomposition targets at identifying individual sovereign objects that encapsulate both a state and certain behavio
We have a buildup of payments that need to be processed. You will need:- To prepare customer account on our site Process payment (you must have working Paypal account to d
Describe the algorithm for updating indices for a single level index when a record is (i) Inserted (ii) deleted What will be the modification if there are multilevel in
What is Normalization? Database normalization is a data design and organization method applied to data structures based on rules that help building relational databases. In rel
An employee record has the following structure struct employee { int eno; char name[22]; float salary; char dept[10];}; (i) Calculate the record size R in bytes.
What is the use of keyword ISA? The use of keyword ISA is to show that a class is a specialization of another class.
Which operator is Cartesian product in relational algebra? Cartesian product in relational algebra is a binary operator. (It requires two operands. e.g., P X Q)
Index And Tree Structure Let us talk about the data structure that is used for creating indexes. Can we use Binary Search Tree (BST) as Indexes? Let us initial reconsider
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd