DB Locking

Optimistic Locking:

In optimistic locking, the system assumes that conflicts between concurrent operations are infrequent. It allows multiple users to read and potentially modify the same resource concurrently, but it checks for conflicts before allowing any changes to be saved.

Optimistic locking is efficient when conflicts are rare because it minimizes contention and allows multiple users to operate on the same resource concurrently. However, it requires conflict resolution mechanisms and may result in some users needing to retry their operations.

Pessimistic Locking: In pessimistic locking, the system assumes that conflicts between concurrent operations are likely, so it locks the resource when a user accesses it, preventing other users from accessing or modifying it until the lock is released.

Pessimistic locking guarantees exclusive access to a resource during the lock's duration, eliminating conflicts. However, it can reduce concurrency and may result in users experiencing delays when trying to access the same resource concurrently.

Optimistic locking is preferred when conflicts are rare, while pessimistic locking is suitable when conflicts are common, and resource contention must be minimized to ensure data

Reference

• https://stackoverflow.com/a/58952004/7502769
• https://www.linkedin.com/pulse/locking-seat-reservation-tauseef-rahaman-tnucc/