Optimistic locking, also referred to as optimistic concurrency control, allows multiple concurrent users to attempt to update the same resource.
Why do all explanations of OCC use the example of a transaction updating only one row? How would OCC work in the case of a transactional update of, for example, two rows?
Why do all explanations of OCC use the example of a transaction updating only one row? How would OCC work in the case of a transactional update of, for example, two rows?