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

Benefits of using a relational database management system, Question 1: ...

Question 1: a) What is the difference between a non-impact and impact printer? b) Which type of printer is generally used in a supermarket to print your receipt? Describe

How to insert data in your table from another table, How to Insert data in ...

How to Insert data in your table from another table? insert into e.g, To insert tuples from employee into N_emp created above, use following statement Insert into N_emp

Top down method and bottom up method, Evaluate, compare and contrast the tw...

Evaluate, compare and contrast the two methods of relational database design namely top down method and Bottom up method. What will be your choice if you are asked to select a meth

Describe deductive databases and relational databases, Problem : (b) A ...

Problem : (b) A deductive database system is essentially the outcome of applying mathematics logic to database management, where logic is used for both data representation and

Accounting and external reporting, List the internal controls that should b...

List the internal controls that should be in effect solely because a EDP system is employed, classifing them as (1) Those controls pertaining to input of information and (2) All ot

Describe all integrity constraints which are violated, Consider the two rel...

Consider the two relations given below Given that A is the primary key of R, D is the primary key of S and there is a referential integrity among S.A and R.A, discuss all

Define rotational latency time, Define rotational latency time. The ti...

Define rotational latency time. The time spent waiting for the sector to be accessed to appear under the head is known as the rotational latency time.

Define shadow paging, Define shadow paging. An alternative to log-based...

Define shadow paging. An alternative to log-based crash recovery method is shadow paging. This technique requires fewer disk accesses than do the log-based methods.

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