In computer science, in the field of databases, write–read conflict (also known as reading uncommitted data and dirty read), is a computational anomaly associated with interleaved execution of transactions.
Specifically, a write–read conflict occurs when "a transaction requests to write an entity, for which an unclosed transaction has already made a read request.
"[1] Given a schedule S T2 could read a database object A, modified by T1 which hasn't committed.
It is possible that interleaved execution can expose this inconsistency and lead to an inconsistent final database state, violating ACID rules.
Note however that Strict 2PL can have a number of drawbacks, such as the possibility of deadlocks.