Explain thomas write rule, Database Management System

Assignment Help:

Explain Thomas' Write rule.  Show how it is different from timestamp ordering protol

Ans: In timestamp-based concurrency control the thomas Write rule is a rule. Given a Timestamp on a transaction T, TS (T) and Write Timestamp on an object O, WTS (O):

 It says if TS(T) < WTS(O), the current write action has been made obsolete through the most  recent write of O, that follows the current write as per to timestamp ordering.

 Given a non-conflict serializable transaction schedule:

 Text: T1:R(A), T2:W(A), T2 Commit, T1: W(A), T1 Commit.

 The Thomas Write Rule based on the fact that T1's write on object A is never seen through any transaction and postulates which is schedule above  is equivalent to the schedule below where T2 takes place strictly after T1, and that therefore the write of T1 can be ignored:

 Text: T1: R (A), T1: W (A), T1 Commit, T2: W (A), T2 Commit.

 This schedule has similar effect as the first and is conflict serializable

 

 


Related Discussions:- Explain thomas write rule

Which method of access uses key transformation, Which method of access uses...

Which method of access uses key transformation? A Hash method of access uses key transformation.

In an e-r diagram an entity set is represent by, In an E-R diagram an entit...

In an E-R diagram an entity set is represent by? In an E-R digram entity set is represted by rectangle.

What is a recursive relationship, Question: (a) Can a set of data requi...

Question: (a) Can a set of data requirements be correctly modelled by two or more different ER diagrams? Explain your answer. You may use a small example, if you think it will

Explain the two types of participation constraint, Explain the two types of...

Explain the two types of participation constraint.  Total: The participation of an entity set E in a relationship set R is said to be total if each entity in E participates i

What are the two methods for dealing deadlock problem, What are the two met...

What are the two methods for dealing deadlock problem? The two procedures for dealing deadlock problem is deadlock detection and deadlock recovery.

Compare wait-die deadlock prevention with wait-wound scheme, Compare wait-d...

Compare wait-die deadlock prevention scheme with wait-wound scheme   Ans:  Wait-Die Scheme  a) Based upon a nonpreemptive technique.  b) If Pi requests a resource present

Misuse of data or a database, As with other software, databases can potenti...

As with other software, databases can potentially be used for unethical purposes. As a database developer, and a consumer, you should recognize database misuse, and how it may affe

What is d command work in the respect of qbe, What is D command work in the...

What is D command work in the respect of QBE? D: It is the command inside QBE to delete tuple(s) from the relation.

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