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 data models namely relational network - hierarchical, Explain the t...

Explain the three data models namely relational, network and hierarchical and evaluate their relative advantages and disadvantages. Hierarchical Model: In hierarchical model, da

Design a gennalization and specialization hierarchy for an a, Design a genn...

Design a gennalization and specialization hierarchy for an automobile sales company

Lack of redundancy, Lack of Redundancy We have talked about the problems o...

Lack of Redundancy We have talked about the problems of repetition of information in a database. Such repetition should be stay away as much as possible. Let us state once again t

Proposed information analysis, Add generation capabilities and/or tailor th...

Add generation capabilities and/or tailor the built-in functionality of generator. This enables you to produce "all" the test data for the MySQL tables you produced in the previous

Explain candidate key, Explain Candidate key? Candidate Key - A candi...

Explain Candidate key? Candidate Key - A candidate key is a minimal superkey, that can be used to uniquely identify a tuple in the relation.

Explain dml with some examples, Explain DML with some examples? DML - D...

Explain DML with some examples? DML - Data Manipulation Language: statements used for managing data within schema objects. Some examples: • SELECT - retrieve data from the a da

Define integrity, (a) Explain briefly the three parts of a relational Model...

(a) Explain briefly the three parts of a relational Model. (b) Contrast the following terms with an appropriate example: (i) stored attribute v/s derived attribute (ii) en

Explain the lock based protocol, Lock Based Protocol A lock is nothing ...

Lock Based Protocol A lock is nothing but a mechanism that tells the DBMS whether a particular data item is being used by any transaction for read/write purpose. As there are t

Components of a typical database environment, Question: (a) List four d...

Question: (a) List four disadvantages of the File Processing System as compared to the Database Systems. (b) The integrity of a database is enforced by integrity rules. One

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