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

Data base design for a museum information system, In this practical assignm...

In this practical assignment, we will run through a complete database application development cycle, starting with the schema design, from an initial data import to database applic

Nested queries, Nested Queries Let us see some more complex queries in ...

Nested Queries Let us see some more complex queries in this section. Sub-queries: Some of the basic concerns of sub-queries are: A sub-query is a SELECT statemen

Illustrate the deployment diagram, Illustrate the Deployment Diagram A...

Illustrate the Deployment Diagram A deployment diagram shows all nodes on network, their processor execution and interconnections. In a dynamic model, this is used to represen

What is use of generating such tables, What is use of generating such table...

What is use of generating such tables? How can you create temporary tables? When you require a table only for a short time after that you want it to disappear automatically you

Data files indices and data dictionary, The indices are accumulated in the ...

The indices are accumulated in the index files. The data is accumulated in the data files. Indices give fast access to data items. For example, a book database may be managed in th

What are the disadvantages of file-processing system, What are the disadvan...

What are the disadvantages of file-processing system?  Ans: The Disadvantages of File-Processing System a. Data redundancy and inconsistency - Data redundancy means not nece

Define weak and strong entity sets, Define weak and strong entity sets? ...

Define weak and strong entity sets? Weak entity set: entity set that do not have key attribute of their own are known as weak entity sets. Strong entity set: Entity set that

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