Explain deadlock detection and recovery, Database Management System

Assignment Help:

Explain Deadlock detection and recovery

Deadlock Detection - A deadlock is said to take place when there is a circular chain of transaction, every waiting for the release of a data - item held by the next transaction in the chain, the algorithm to detect a deadlock is relies on the detection of such type of a circular chain in the current system in wait - for - graph. The algorithm produces the wait - for - graph at regular intervals and observes it for a chain. The algorithm begins with the assumption that there is no deadlock. 

Deadlock Recovery - To recover from deadlock. The cycles in the wait - for - graph should be broken. The general method of doing this is to roll back one or much more transactions in the cycles till the system shows no further deadlock situation. The procedure of deadlock recovery must make sure that a given transaction is not constantly the one chosen for rollback. The selection of the transaction to be rolled back is relies on the following considerations: 

  • The progress of the transaction and the number of data - items it has employed and modified.
  • The amount of computing lasting for the transaction and the number of data - items that have yet to be accessed through the transaction.
  • The relative cost of rolling back a transaction.

Related Discussions:- Explain deadlock detection and recovery

Define the term- having clause and a where clause, What is the difference ...

What is the difference between a HAVING CLAUSE and a WHERE CLAUSE? HAVING CLAUSE - HAVING CLAUSE is used only with SELECT statement. - It is normally used in a GROUP BY

Illustration of implementation of inheritance, Illustration of implementati...

Illustration of implementation of inheritance Let us take the illustration of implementation of inheritance. Suppose that we are about to implement the Stack class and by now w

Explain the project-join normal form, Explain the Project-Join normal form ...

Explain the Project-Join normal form A relation R is in PJNF along with respect to a set of functional dependencies D if for all join dependencies of the outline *(R 1 , R 2 ,

Serialisable schedules, Serialisable Schedules: If the processes of two tra...

Serialisable Schedules: If the processes of two transactions conflict with each other, how to verify that no concurrency related problems have happened? For this, serialisability t

What is a dataset, What is a dataset? A dataset is an in-memory databas...

What is a dataset? A dataset is an in-memory database that is disconnected from any regular database, but has all the significant characteristics of a regular database. Dataset

2phase locking, we need example of 2phase locking

we need example of 2phase locking

Physical location of record is determined by which formula, The physical lo...

The physical location of a record is determined by which mathematical formula that transforms a file key into a record location? The physical location of a record is determined

Compare the nested-loop join and block-nested loop join, Compare the Nested...

Compare the Nested-loop join and block-nested loop join Ans: Nested  loop join - It is costly as worst case cost, no. of block accesses needed is n r * b s + b r   where b

How do you find the final model after iterative analysis, How do you find t...

How do you find the final model after iterative analysis? Why is iterative analysis of any of the problem needed? The final model serves as the base for system architectur

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