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

What is data defination language, What is DDL? Make a list of commands with...

What is DDL? Make a list of commands with short description used in DDL Ans: Data Definition Language that is abbreviated as DDL is a computer language for defining data struct

Explain the 10 reasons to use mysql, Question 1 Explain the 10 reasons to ...

Question 1 Explain the 10 reasons to use MySQL Question 2 Write the SQL statements to demonstrate the following using SELECT command Expression Evaluation ORDER BY

Decompose the table with the functional dependencies, Decompose the table w...

Decompose the table with the following description and functional dependencies into a set of equivalent tables normalized to 3NF or BCNF. This database stores records from a (ve

Ddl compiler-database management system, DDL Compiler The DDL compile...

DDL Compiler The DDL compiler changes the data definition statements (such as CREATE TABLE .... in SQL) into a set of tables having metadata tables. These tables have infor

Explain superkey, Explain Superkey Ans: A superkey is described in the ...

Explain Superkey Ans: A superkey is described in the relational model of database organization like a set of attributes of a relation variable for which it holds that in all re

Derived horizontal fragmentation, Derived horizontal fragmentation: Some ap...

Derived horizontal fragmentation: Some applications may include a join of two or more relations. If the relations are stored at dissimilar locations, there may be a major overhead

Express the properties of strings, Express the properties of Strings? ...

Express the properties of Strings? Strings can be case sensitive (or not) which can change the outcome of string operations. You can evaluate whole strings \ just part

Define the terms - physical schema and logical schema, Define the terms  1)...

Define the terms  1) physical schema 2) logical schema.  Physical schema:  The physical schema explains the database design at the physical level, which  is  the  lowest  lev

What are the two methods for dealing deadlock problem, What are the two met...

What are the two methods for dealing deadlock problem? The two procedures for dealing deadlock problem is deadlock detection and deadlock recovery.

What are the factors into account when choosing a raid level, What are the ...

What are the factors to be taken into account when choosing a RAID level? A) Monetary cost of extra disk storage requirements. B) Performance requirements in terms of number

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