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

Explain candidate key and super key, Explain Candidate Key and Super Key ...

Explain Candidate Key and Super Key A super key is a set of one or more than attributes that, taken collectively, permits us to identify uniquely a tuple in the relation. Wher

Explain the form of the create view command, We define a view in SQL throug...

We define a view in SQL through using the create view command. To describe a view, we must provide the view a name and must state the query in which computers the view. The form of

Distributed query and transaction processing, Distributed query and transac...

Distributed query and transaction processing a.  Construct a query around any one of the functional divisions you made in 4a such that if executed in the distributed design of 4

When is a transaction rolled back, When is a transaction rolled back? A...

When is a transaction rolled back? Any changes that the aborted transaction made to the database must be uncompleted. While the changes caused by an aborted transaction have be

Give example of relational schema, An instance of relational schema R (A, B...

An instance of relational schema R (A, B, C) has distinct values of A including NULL values. then A is a candidate key or not? If relational schema R (A, B, C) has distinct val

Discuss the problem of spurious tuples, Discuss the problem of Spurious tup...

Discuss the problem of Spurious tuples and how we may prevent it.    Ans:  A spurious tuple is, mainly, a record in a database that gets created while two tables are joined bad

Example for while until, Assume you are given a uniprocessor system with on...

Assume you are given a uniprocessor system with one gigabyte of memory and a 300 gigabyte disk. The OS on the machine has a demand paged virtual memory system with a local page rep

Explain hashing techniques, Explain Hashing techniques The hashing tech...

Explain Hashing techniques The hashing techniques can be categorized as: Static Hashing Techniques - In this method, the data can be viewed a collection of buckets, along with

Determine the benefits of object oriented design, Determine the benefits of...

Determine the benefits of Object oriented design OOD also gives reusability, which saves time, costs and productivity gains through direct mapping to properties of Object-Orie

Write short notes on index structure of files, WRITE SHORT NOTES ON INDEX S...

WRITE SHORT NOTES ON INDEX STRUCTURE OF FILES? There are two basic parts of indices 1.   Ordered indices 2.   Hash indices Every technique must be evaluated on the bas

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