Encyclopedia > Thomas Write Rule

  Article Content

Thomas write rule

Redirected from Thomas Write Rule

In computer science, in the field of databases, the Thomas Write rule is a rule in timestamp-based concurrency control.

Given a Timestamp on a transaction T, TS(T) and Write Timestamp on an object O, WTS(O):

It states if TS(T) < WTS(O), the current write action has been made obsolete by the most recent write of O, which follows the current write according to timestamp ordering.

Given a non-conflict serializable transaction schedule:

<math>\begin{bmatrix}
T1 & T2 \\ R(A) & \\
 &W(A)   \\
& Com. \\ W(A) & \\ Com. & \end{bmatrix}</math>

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

The Thomas Write Rule relies on the fact that T2's write on object A is never seen by any transaction and postulates that the schedule above is equivalent to the schedule below:

<math>\begin{bmatrix}
T1 & T2 \\ R(A) & \\ & Com. \\ W(A) & \\ Com. & \end{bmatrix}</math>

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

This schedule is the same as the first and is conflict serializable.



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Lake Ronkonkoma, New York

... a total area of 12.7 km² (4.9 mi²). 12.7 km² (4.9 mi²) of it is land and none of the area is covered with water. Demographics As of the census of ...

 
 
 
This page was created in 77 ms