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

Describe drop table command or cascade of sql, Describe DROP TABLE command ...

Describe DROP TABLE command of SQL along with both the options - CASCADE and RESTRICT. DROP TABLE command - This command drops the specified table. Dropping a table also dro

Explain the exec statement in sql, Explain the EXEC statement in SQL  A...

Explain the EXEC statement in SQL  Ans: All statements which start with EXEC SQL are embedded SQL database statements. High level languages such as C can be employed to write a

DBMS, what is specialization?

what is specialization?

Define catalog and meta data, Define Catalog and meta data ? A catalog ...

Define Catalog and meta data ? A catalog is a compilation of records elaborating the contents of a particular collection or group of collections. Metadata (Meta data, or someti

Relational algebra and calculus, Q.  What is relational algebra and calcul...

Q.  What is relational algebra and calculus? Explain the relational algebra operators :- Selection and predicate, set operation, joins and division. Sol. Relational Algebra

Give expression in tuple calculus and domain calculus, Consider the subsequ...

Consider the subsequent relation schemes:  Project (Project#, Project_name, chief_architect)  Employee (Emp#, Empname)  Assigned_To (Project#, Emp#)  Give expression i

What is bankers algorithm, What is banker's algorithm?  Banker's algori...

What is banker's algorithm?  Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple instances of each resource ty

Define null values, Define null values. In some cases a certain entity ...

Define null values. In some cases a certain entity may not have an applicable value for an attribute or if we do not know the value of an attribute for a certain entity. In the

What is a recursive relationship, What is a recursive relationship? Give an...

What is a recursive relationship? Give an example not used in the text. A recursive relationship is a relationship among an entity and itself. For example, given the entity PER

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