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 are the three data anomalies, What are the three data anomalies that a...

What are the three data anomalies that are likely to occur as a result of data redundancy?  Can data redundancy be completely eliminated in database approach?  Why or why not? A

Relationship, What is multiple relationship ?

What is multiple relationship ?

Benefits and drawbacks of heap files, Benefits of heap files 1.   This i...

Benefits of heap files 1.   This is a easy file Organisation method. 2.   Insertion is somehow capable. 3.   Good for bulk-loading data into a table. 4.   Best if file

Define decision tree classifiers, Define decision tree classifiers? As ...

Define decision tree classifiers? As the name suggests decision tree classifiers use a tree: Every leaf node has an associated class, and every internal node has a predicate as

Create data base table apply key and functions, CREATE YOUR DATABASE TABLES...

CREATE YOUR DATABASE TABLES Your database project must have a minimum of four tables. Include the SQL scripts used to create the tables in your documentation. Explain the tables

Keys - relational database integrity, Candidate Key:  In a relation R, a ca...

Candidate Key:  In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1)        Uniqueness:                N

Distributed and client server databases, Distributed And Client Server Data...

Distributed And Client Server Databases Introduction This unit tells the distributed database systems which are primarily relational and one important execution model: the

What are the types of storage devices, What are the types of storage device...

What are the types of storage devices? Primary storage Secondary storage Tertiary storage Volatile storage Nonvolatile storage

Explain the equijoin, Explain the θ-join and equijoin Refer tables Car ...

Explain the θ-join and equijoin Refer tables Car and Boat which list models of cars and boats and their relevant prices. Assume a customer wants to buy a car and a boat, but sh

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