Define deadlock recovery measures, Database Management System

Assignment Help:

Define Deadlock recovery measures                  

To recover from deadlock, the cycle in the wait-for-graph should be broken. The common technique of doing this is to rollback one or more than one transactions in the cycles until the system shows no further deadlock situation. The choice of the transaction to be rolled back is relies on the following deadlock recovery measures:

  • The progress of the transaction and the number of data-items it has employed and modified. It is preferable to rollback a transaction which has just started or has not altered any data-item.
  • The amount of computing remaining for the transaction and the number of data items which have yet to be accessed by the transaction. It is favourable not to rollback a transaction it has approximately run to completion and/or it needs very few additional data-items earlier than its termination.
  • The relative cost of rolling back a transaction. It is favourable to roll back a less significant or non-critical transaction.

Related Discussions:- Define deadlock recovery measures

What is oracle process explain for processes of oracle, What is Oracle Proc...

What is Oracle Process? Explain any four processes started by Oracle. Oracle Process is as follows: SMON: The System Monitor carries out a crash recovery while a crashed in

Difference between left outer join and right outer join, Difference between...

Difference between LEFT OUTER JOIN and RIGHT OUTER JOIN In left outer join tuples from the left-hand-side relation which do not match any tuple in the right-hand-side relation

What is a b+-tree index, What is a B+-Tree index? A B+-Tree index takes...

What is a B+-Tree index? A B+-Tree index takes the form of a balanced tree in which each path from the root of the root of the root of the tree to a leaf of the tree is of the

Write modified version of transfer that avoids deadlock, Your OS has a set ...

Your OS has a set of queues, each of which is protected by a lock. To enqueue or dequeue an item, a thread must hold the lock associated to the queue. You need to implement an a

Relation schema for student, Example RELATION SCHEMA for STUDENT: STU...

Example RELATION SCHEMA for STUDENT: STUDENT (Roll No: string, name: string, login: string, age: integer) RELATION INSTANCE

Need web-based database, Our company hires independent contractors to insta...

Our company hires independent contractors to install equipment at precise locations across North America. We want to track the installation data and generate reports. The compan

Define partial, Partial Key : It is a group of attributes that can uniquel...

Partial Key : It is a group of attributes that can uniquely identify small entities and that are related to same base entity. It is sometime named as Discriminator.  Altern

What are temporary tables, What are temporary tables? Temporary tables...

What are temporary tables? Temporary tables exist solely for a particular session or whose data persists for the duration of the transaction.

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

DW, #ques Define a job scheduling strategy that will meet business requirem...

#ques Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a p

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