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 S <math>S = \begin{bmatrix} T1 & T2 \\ R(A) & \\ & R(A) \\ & W(A)\\ & Com. \\ R(A) & \\ W(A) & \\ Com. & \end{bmatrix}</math> In this example, T1 has read the original value of A, and is waiting for T2 to finish.

PropertyValue
dbpprop:abstract
  • 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 S <math>S = \begin{bmatrix} T1 & T2 \\ R(A) & \\ & R(A) \\ & W(A)\\ & Com. \\ R(A) & \\ W(A) & \\ Com. & \end{bmatrix}</math> In this example, T1 has read the original value of A, and is waiting for T2 to finish. T2 also reads the original value of A, overwrites A, and commits. However, when T1 reads to A, it discovers two different versions of A, and T1 would be forced to abort, because T1 would not know what to do. This is an unrepeatable read. This could never occur in a serial schedule. Strict two-phase locking (Strict 2PL) prevents this conflict.
dbpprop:hasPhotoCollection
rdfs:comment
  • 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 S <math>S = \begin{bmatrix} T1 & T2 \\ R(A) & \\ & R(A) \\ & W(A)\\ & Com. \\ R(A) & \\ W(A) & \\ Com. & \end{bmatrix}</math> In this example, T1 has read the original value of A, and is waiting for T2 to finish.
rdfs:label
  • Read-Write conflict
owl:sameAs
skos:subject
foaf:page
is dbpprop:disambiguates of
is dbpprop:redirect of