Wait-die scheme -deadlock prevention, Database Management System

Wait-die" scheme: The idea is based on non-preventive method. It is based on a simple rule:

                                If Ti requests a database resource that is held by Tj

                                then if Ti has a smaller timestamp than that of Tj

                                 it is permitted to wait;

                else Ti aborts.

A timestamp may loosely be described as the system generated sequence number that is unique for every transaction. Therefore, a smaller timestamp means an older transaction. For example, suppose that 3 transactions T1, T2 and T3 were generated in that series, then if T1requests for a data item which is presently held by transaction T2, it is permitted to wait as it has a smaller time stamping than that of T1. Though, if T3 requests for a data item which is presently held by transaction T2, then T3 is rolled back (die).

                                       1541_Wait-die scheme -Deadlock prevention.png

                                                            Figure: Wait-die Scheme of Deadlock prevention

Posted Date: 3/12/2013 3:10:06 AM | Location : United States







Related Discussions:- Wait-die scheme -deadlock prevention, Assignment Help, Ask Question on Wait-die scheme -deadlock prevention, Get Answer, Expert's Help, Wait-die scheme -deadlock prevention Discussions

Write discussion on Wait-die scheme -deadlock prevention
Your posts are moderated
Related Questions
sql is relationally complete-justify

What is ICR? A. ICR (Intelligent Character Recognition) is a technology that gives scanning and imaging systems the ability to identify images of hand-printed or script charact

Explain weak and strong entity type ? Weak and Strong entity type: An entity set which does not have a primary key is referred to as a weak entity set. The existence of a wea

Define identify relationship? Identifying relationship: An identifying relationship means in which the child table cannot be uniquely recognize without the parent. For exampl

Explain mechanism of nested queries? SQL gives a mechanism for nesting subqueries. A subquery is a select from where expression that is nested within one more query. A common u

Define lock? Lock is the most common used to execute the requirement is to permit a transaction to access a data item only if it is currently holding a lock on that item.

Explain the Relational Completeness Codd described the term relational completeness to consider to a language that is complete with respect to first-order predicate calculus ex

System R was developed and designed over a period of 1974-79 at IBM San Jose Research Company. Its purpose was to illustrate that it is possible to create a Relational System tha

What is Nested Queries explain in details? Nested Queries - A SELECT query could have subquery(s) in it. While a SELECT query having another SELECT query in it, is known as n

Illustrate the term- Abstracting Out Common Behaviour Inheritance is not every time recognised during analysis phase of development, thus it is necessary to re-evaluate object