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

Relationships, Let us first describe the term relationships. What Are Re...

Let us first describe the term relationships. What Are Relationships? A relationship can be defined as: A set of associations or connection, or A rule for communic

Describe in brief about object oriented design, Describe about Object orien...

Describe about Object oriented design Object oriented design is concerned with developing an object oriented model of a software system to implement known requirements. Many OO

Log based recovery, under what condition log based recovery is feasible?

under what condition log based recovery is feasible?

What are wait-for-graphs, What are wait-for-graphs?Give the algorithm to co...

What are wait-for-graphs?Give the algorithm to construct a wait-for-graph from a given schedule of transactions? How can deadlocks be detected from wait-for-graphs?   Ans:  The

Database incident table, The Incident table, with an auto-incrementing in...

The Incident table, with an auto-incrementing incident number, etc, looks like: incident_num reporter date time incide

Define access time, Define access time. Access time is the time from wh...

Define access time. Access time is the time from when a read or write request is issued to when data transfer starts.

What are the objectives of query processing, What are the objectives of que...

What are the objectives of query processing?       Ans: The objectives of query processing is to transform a query written in a high level language into a accurate and efficien

What is known as fudge factor, What is known as fudge factor? The numbe...

What is known as fudge factor? The number of partitions is enhanced by a small value called the fudge factor, which is usually 20 percent of the number of hash partitions compu

Key, Q.   Explain the terms key constraints participation constraints and m...

Q.   Explain the terms key constraints participation constraints and mapping caradinalities in ER model.  Participation Constraints :   The participation of an entity set E i

Describe the different raid levels, Describe the different RAID levels.  Di...

Describe the different RAID levels.  Discuss the choices of the different RAID levels for different applications.          Ans:   There are several combinations of these approa

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