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

Mapping, How external/conceptual mapping and conceptual /internal mapping i...

How external/conceptual mapping and conceptual /internal mapping is performed

What is deadlock, What is deadlock? Neither of the transaction can ever...

What is deadlock? Neither of the transaction can ever proceed with its normal implementation. This situation is known as deadlock.

The proliferation of object-oriented methods, The Proliferation of Object-O...

The Proliferation of Object-Oriented Methods The first few years of the 1990s saw blossoming of around fifty various object oriented methods. This proliferation is a sign of g

What is a primary index, What is a primary index? A primary index is an...

What is a primary index? A primary index is an index whose search key also explains the sequential order of the file.

Write query to insert data in student table, Consider student (std_id, std_...

Consider student (std_id, std_name, date_of_birth, phone, dept_name). Put the data for a student with student id200, name arun, birth date 1 February, 1985, phone number (01110 328

Explain about primary key, Explain about primary key Primary Key: It ...

Explain about primary key Primary Key: It is one of the candidate keys that are taken to be the recognizing key for the entire table. E.g. although there are two candidate ke

Spanned and unspanned organisation, Spanned and unspanned organisation? ...

Spanned and unspanned organisation? Spanned and unspanned organization: If records are not permited to cross block boundaries then the organisation is called unspanned record

What is cardinality ratio, What is Cardinality Ratio? Cardinality Rati...

What is Cardinality Ratio? Cardinality Ratios - The cardinality ratios for relationship kinds specifies the maximum number of relationship instances in which an entity can pa

Describe the concept of aggregation, Aggregation Aggregation is strong...

Aggregation Aggregation is stronger form of association. It represents the "has-a" or "part-of" relationship. An aggregation association depicts a complex object which is comp

Sequential file organisation, Sequential File Organisation The most nec...

Sequential File Organisation The most necessary way to organise the collection of records in a file is to use sequential Organisation. Records of the file are stored in series

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