Describe the algorithm to draw the dependency graph, Database Management System

Assignment Help:

Describe the algorithm to draw the dependency graph?  

Ans: Algorithm to draw Precedence Graph is like this:

a.  For every transaction Ti participating in schedule S, make a node labeled Ti in the precedence graph.

b.  For every case in S where Tj executes a read_item(X) after Ti executes a write_item(X), create an edge (Ti→Tj) in the precedence graph.

c.  For every case in S where Tj executes a write_item(X) after Ti executes a read_item(X), create an edge (Ti→Tj) in the precedence graph.

d.  For every case in S where Tj executes a write_item(X) after Ti executes a write_item(X), create an edge (Ti→Tj) in the precedence graph.

e.  The schedule S is serializable if and only if the precedence graph has no cycles.


Related Discussions:- Describe the algorithm to draw the dependency graph

Mapping, external and internal mapping with examples

external and internal mapping with examples

What is the use of raid, What is the use of RAID? A variety of disk-org...

What is the use of RAID? A variety of disk-organization methods, collectively called redundant arrays of independent disks are used to better the performance and reliability.

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

Describe entity referential integrity and integrity, Describe entity refere...

Describe entity referential integrity and integrity. Give an example of each. Entity Integrity Rule - If there is a attribute A of relation R is a prime attribute of R then A

What is ocr, What is OCR? OCR (Optical Character Recognition) is a tech...

What is OCR? OCR (Optical Character Recognition) is a technology that enables you to change different types of machine-readable documents, like scanned paper documents, PDF fil

Define the five basic operators of relational algebra, Define the five basi...

Define the five basic operators of relational algebra? Five basic operators of relational algebra are: 1. Union (∪∪∪∪) - Selects tuples which are in either P or Q or in both

Describe the types of attributes, Describe the types of attributes? Ty...

Describe the types of attributes? Types of attributes: An attribute's category determines the type of values that are permitted in the attribute. For instance, the value vers

Define variable-length records arise in database, What are the ways in whic...

What are the ways in which the variable-length records arise in database systems? Storage of many record types in a file. Record types that permit variable lengths for one o

Differentiate between a unique key and a primary key, Differentiate between...

Differentiate between a unique key and a primary key. - By default, clustered index on column are created by primary key while nonclustered index are created by unique key.

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