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

Critically evaluate the bulleted list of information, Critically evaluate t...

Critically evaluate the bulleted list of information-related items in this case study. How are each contradictory to the notion of being an information-literate knowledge worker?

Describe the concepts of structural semantic data model, Question 1 List a...

Question 1 List and explain various Normal Forms. How BCNF differs from the Third Normal Form and 4th Normal forms? Question 2 Describe the concepts of Structural Semantic Da

Define the basic operations of the relational algebra, Define the basic ope...

Define the basic operations of the relational algebra?     Ans: Basic operators of relational algebra are: 1. Union (∪) - Selects tuples which are in either P or Q or in bot

Illustrate the state model for the atm class, Illustrate the State model fo...

Illustrate the State model for the ATM class let us take state model for the ATM class given below in Figure showing state model of the ATM class and the pseudo code derived fr

Heterogeneous ddb and homogeneous ddb, Probelm: (a) A distributed datab...

Probelm: (a) A distributed database (DDB) is a collection of multiple, logically interrelated databases which are physically distributed over a computer network" (i) Give a

Which product produces the relation that has attributes, Which product prod...

Which product produces the relation that has attributes of R1 and R2 ? Cartesian product produce the relation which has attributes of R1 and R2

What is called a query -execution engine, What is called a query -execution...

What is called a query -execution engine? The query implementation engine takes a query evaluation plan, implements that plan, and returns the answers to the query.

Can a domain, Can a domain, assigned to a data element be changed? Yes....

Can a domain, assigned to a data element be changed? Yes.  We can do so by just overwriting the entry in the field domain.

Give detail explanation about cross-section of twisted pair, The cross-sect...

The cross-section of twisted pair The cross-section of each and every strand of the twisted pair is π/4 square mm. A 10-km length of this type of material, with two strands per

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