Define the wait for graph, Database Management System

Assignment Help:

Define the Wait for graph

Ans: The wait-for-graph is a directed graph and consist 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. If there is a transaction Ti, waiting for a data-item that is presently allocated and held by transaction Tj, after that there is a directed arc from the node for transaction Ti, to the node for transaction Tj. The wait-for-graph is employed for detection of deadlock in the system. If there is cycle exits in the graph, all the transaction (denoted as nodes) are in deadlock, which are in the cycle.


Related Discussions:- Define the wait for graph

Inconsistent analysis-problems of concurrent transactions, Inconsistent Ana...

Inconsistent Analysis : The problem as given with transactions T1 and T2 where two transactions interleave to make incorrect result during an analysis by Audit is the instance of s

Explain the terms data warehousing and data mining, Question: i) Explai...

Question: i) Explain the terms data warehousing and data mining. ii) Discuss the importance of the following security principles that a digital firm should amongst others, n

What is called query processing, What is called query processing? Query...

What is called query processing? Query processing refers to the range of activities included in extracting data from a database.

What are the aggregate objects in the data dictionary, What are the aggrega...

What are the aggregate objects in the data dictionary? Views Match codes Lock objects.

Decomposition, properties of derirable decomposition

properties of derirable decomposition

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

How can you map null values to other values while display, How can you map ...

How can you map NULL values to other values while display? IF( ) , IFNULL( ) keywords are used to do so. They are 'LIMIT' is used for the following kinds of problems: 1) Ans

Normalization, in case of functional dependencies how we get the higher nor...

in case of functional dependencies how we get the higher normal form.

Single-valued dependencies, Single-Valued Dependencies A database is a ...

Single-Valued Dependencies A database is a collection of related information and it is therefore inevitable that some items of information in the database would depend on some

What are the two types of serializability, What are the two types of serial...

What are the two types of serializability? The two types of serializability is a)      Conflict serializability b)      View serializability

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