What are wait-for-graphs, Database Management System

Assignment Help:

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 wait-for-graph is a directed graph and consists of nodes and directed arcs; the nodes of the graph are active transactions. An arc of the graph is inserted among two nodes if there is a data-item is needed by the node at the tail of the arc that is being held by the node at the head of the arc. 

  Algorithm to construct wait-for-graph is as follows:

1.  For every transaction Ti active at the time of deadlock detection, make a node labeled Ti in the wait-for-graph.

2.  For every case, if there is a transaction Ti, waiting for a data-item that is at present allocated and held by transaction Tj, then there is a directed arc from the node for transaction Ti, to the node for transaction Tj.

3.  For every case, if there is a directed arc from the node for transaction Ti, to the node for transaction Tj and transaction Tj released the lock, after that remove the arc between them.

4.  There no deadlock if the wait-for-graph is acyclic.  

The wait-for-graph is employed for detection of deadlock in the system. If there is any cycle exits in the wait-for-graph, all the active transaction (denoted as nodes) are in deadlock that are in the cycle.


Related Discussions:- What are wait-for-graphs

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

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

Sorting-stacks, 1. Identify the comparisons and exchanges made to sort the ...

1. Identify the comparisons and exchanges made to sort the following array using the selection exchange sort technique. Note: you may not need all columns. Ori

Explain alternate key, Explain Alternate key? Alternate Key - All the...

Explain Alternate key? Alternate Key - All the candidate keys except primary key are known as alternate keys.

Explain algorithm of er to relational mapping, Explain algorithm of ER To R...

Explain algorithm of ER To Relational Mapping ? ER-to-Relational Mapping Algorithm: 1) Step 1: Mapping of regular entity types: For each strong entity type E, form a relatio

A distributed transaction, A Distributed Transaction Let us demonstrate...

A Distributed Transaction Let us demonstrate the concept of a distributed transaction by considering a banking system having of three branches located in 3 different cities. Ev

Database project- inventory database for a hardware store, Normal 0 ...

Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4

How to apply the bcnf decomposition , Consider the following relational sch...

Consider the following relational scheme: R (a,b,c,d,e,f) and its corresponding set of FDs {d→ a, be → c, ac → e, b → f, f → d, a → c}. a. Is the following decomposition i) non

Two phase locking technique, growing phase and shrinking phase are disjoint...

growing phase and shrinking phase are disjoint, why ?

Provide examples of different types of time and date formats, Provide Examp...

Provide Examples of different types of Time and Date formats.  It's most common store dates using a dash (-) as a colon (:)and the delimiter as the time delimiter. The given fo

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