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

Design of distributed databases, Design Of Distributed Databases: The dist...

Design Of Distributed Databases: The distributed databases are mainly relational at local level. So a local database schema is the similar as that of a centralised database design

What are composite attributes, What are composite attributes? Composite...

What are composite attributes? Composite attributes can be separated in to sub parts.

Aims of the design project, The aims of the project are: 1. To enable th...

The aims of the project are: 1. To enable the students to undertake the detailed design of a specific plant or process 2. The design projects includes: process selection; und

Managing databases, Code an Oracle Database trigger to enforce the constrai...

Code an Oracle Database trigger to enforce the constraint that an employee can never change his or her department.

Which component is not included in database environment, Which component is...

Which component is not included in database environment ? A users component is not included in database environment.

Define the wait for graph, Define the Wait for graph Ans: The wait-for-...

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 grap

Drop table command, DROP TABLE Command: When an existing object is not ...

DROP TABLE Command: When an existing object is not needed for further use, it is always better to eliminate it from the database. To remove the existing object from the databas

What is use of generating such tables, What is use of generating such table...

What is use of generating such tables? How can you create temporary tables? When you require a table only for a short time after that you want it to disappear automatically you

What is meant by object-oriented data model, What is meant by object-orient...

What is meant by object-oriented data model? The object-oriented paradigm is based on encapsulation of data and code related to an object in to a one unit, whose contents are n

Explain domain calculus, Explain Domain calculus Domain calculus is one...

Explain Domain calculus Domain calculus is one of the types of the relational calculus. The formal specification of the domain calculus was planned after the development of the

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