How can we avoid deadlocks in applications? _ MySQL

An inevitable feature of any lock-based concurrent system is that the system may be congested under certain conditions. When one connection occupies one lock and another connection tries to change the lock status, the second connection either waits for the first connection to release the lock or is blocked as a result. To achieve the best scalability, performance, and concurrency, when designing applications and query statements, you should minimize the length of transactions and reduce the lock occupation time. Most concurrency problems often occur in the design phase of applications and databases. therefore, one unavoidable feature of any lock-based concurrency system is that the system may be congested under certain conditions if this factor is fully taken into account during the design phase. When one connection occupies one lock and another connection tries to change the lock status, the second connection either waits for the first connection to release the lock or is blocked as a result.

To achieve the best scalability, performance, and concurrency, when designing applications and query statements, you should minimize the length of transactions and reduce the lock occupation time. Most concurrency problems often occur in the design phase of applications and databases. Therefore, it is critical to take this factor into full consideration during the design phase. Otherwise, applications may have potential defects, which are generally discovered only during application scalability tests.