Optimistic locking vs pessimistic locking Imagine two developers updating the same database row at the same time. One of them will have their update rejected. H... (opens in new tab)

Optimistic locking vs pessimistic locking Imagine two developers updating the same database row at the same time. One of them will have their update rejected. How should the system handle this? There are two common approaches. Optimistic locking assumes conflicts are rare. Both users read the data without acquiring any lock. Each record carries a version number. When a user attempts to write, the database checks: does the version in your update match the current version i...