Wait-die scheme: It is a non-preemptive technique for deadlock prevention. When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp smaller than that of Tj (That is Ti is older than Tj), otherwise Ti is rolled back (dies)
For example:
Suppose that transaction T22, T23, T24 have time-stamps 5, 10 and 15 respectively. If T22requests a data item held by T23 then T22 will wait. If T24 requests a data item held by T23, then T24 will be rolled back.
Wound-wait scheme: It is a preemptive technique for deadlock prevention. It is a counterpart to the wait-die scheme. When Transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp larger than that of Tj, otherwise Tj is rolled back (Tj is wounded by Ti)
For example:
Suppose that Transactions T22, T23, T24 have time-stamps 5, 10 and 15 respectively . If T22requests a data item held by T23, then data item will be preempted from T23 and T23 will be rolled back. If T24 requests a data item held by T23, then T24 will wait.
Hi there, I found your web site by means of Google while searching
for a related matter, your web site got here up, it seems good.
I’ve bookmarked it in my google bookmarks.
Hi there, just changed into alert to your weblog thru Google, and located that
it is truly informative. I am going to watch out for brussels.
I’ll appreciate for those who proceed this in future.
Many people will likely be benefited from your writing.
Cheers!
You really make it appear really easy with your presentation but I in finding this topic to be really one thing that I think I
would by no means understand. It sort of feels too complex and very vast for me.
I am taking a look ahead for your next submit, I’ll try to get the grasp of it!
Very nice,Thanks…
Very Well Explained. Thanks.
Thanks , easy explanation.
Nice.. short explanation.. but I need more visual example.. is it possible? Thank you..
Vey well understood. Thank you and God bless you 🙂
Hi, can you please help with the below question
Consider the sequence of actions given below, listed in the order it is submitted to the
DBMS. The timestamps of the transactions involved are as follows:
T1 = 10345, T2 = 10346, T3 = 10347
T3: R(Y),
T3: W(X),
T1: R(Z),
T1: W(Z),
T2: R(X),
T1: W(Y),
T3: W(U),
T2: R(Z),
T1: R(U),
T1 commits,
T2 commits
Make use of timestamping concurrency control, implemented using the Wound / Wait AND Wait/Die scheme
scheme, to show how the sequence is handled.
Hi to every one, it’s truly a good for me to pay a visit this
web page, it includes priceless Information.
I really like your blog.. very nice colors & theme. Did you create this website yourself or did you hire someone to do it for you?
Plz reply as I’m looking to create my own blog and would like
to find out where u got this from. many thanks
Thank you for showing interest in our website. It’s based on the WordPress platform which has these themes with colors etc.