Write-Write conflict

Write-Write conflict

In computer science, in the field of databases, Write-Write Conflict, also known as overwriting uncommitted data is a computational anomaly associated with interleaved execution of transactions.

Given a schedule H

H = egin{bmatrix}T1 & T2 \W(A) & \ & W(B) \W(B) & \Com. & \ & W(A)\ & Com. end{bmatrix}

note that there is no read in this schedule. The writes are called "blind writes".

We have a "lost update". Any attempts to make this schedule serial would give off two different results (either T1's version of A/B is shown, or T2's version of A and B is shown), and would not be the same as the above schedule. This schedule would not be serializable.

Strict 2PL, overcomes this inconsistency by locking T1 out from B. Unfortunately, deadlocks are something Strict 2PL does not overcome all the time.

See also

* Concurrency control
* Read-Write conflict
* Write-Read conflict


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Write–write conflict — In computer science, in the field of databases, Write Write Conflict, also known as overwriting uncommitted data is a computational anomaly associated with interleaved execution of transactions. Given a schedule S note that there is no read in… …   Wikipedia

  • Read-Write conflict — In computer science, in the field of databases, Read Write Conflict, also known as unrepeatable reads, is a computational anomaly associated with interleaved execution of transactions. Given a schedule D:D = egin{bmatrix}T1 T2 R(A) R(A) W(A) Com …   Wikipedia

  • Conflict — may refer to: Contents 1 Movies and television 2 Games 3 Magazines …   Wikipedia

  • Write-Read conflict — In computer science, in the field of databases, Write Read Conflict, also known as reading uncommitted data, is a computational anomaly associated with interleaved execution of transactions.Given a schedule D:D = egin{bmatrix}T1 T2 R(A) W(A)… …   Wikipedia

  • Write–read conflict — In computer science, in the field of databases, Write Read Conflict, also known as reading uncommitted data, is a computational anomaly associated with interleaved execution of transactions. Given a schedule S T2 could read a database object A,… …   Wikipedia

  • Write-Back — Cache [kæʃ] bezeichnet in der EDV eine Methode, um Inhalte, die bereits einmal vorlagen, beim nächsten Zugriff schneller zur Verfügung zu stellen. Caches sind als Puffer Speicher realisiert, die die Kopien zwischenspeichern. Sie können als… …   Deutsch Wikipedia

  • Write-Through — Cache [kæʃ] bezeichnet in der EDV eine Methode, um Inhalte, die bereits einmal vorlagen, beim nächsten Zugriff schneller zur Verfügung zu stellen. Caches sind als Puffer Speicher realisiert, die die Kopien zwischenspeichern. Sie können als… …   Deutsch Wikipedia

  • Conflict thesis — For a socio historical theory with a similar name, see Conflict theory. Conflict: Galileo before the Holy Office, by Joseph Nicolas Robert Fleury, a 19th century depiction of the Galileo Affair, religion suppressing heliocentric science. The… …   Wikipedia

  • Conflict of succession laws — Conflict of laws Preliminiarie …   Wikipedia

  • 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 …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”