How to handle massive Concurrent Data Operations

File Cache, database cache, optimized SQL, data shunting, horizontal and vertical division of database tables, and optimized code structure! Summary 1. why do the following data inconsistencies occur when multiple users are locked for concurrent database operations? Update A and B are lost, read and modify the same data, the Modification result of one user destroys another

File Cache, database cache, optimized SQL, data shunting, horizontal and vertical division of database tables, and optimized code structure! Summary 1. why do the following data inconsistencies occur when multiple users are locked for concurrent database operations? Update A and B are lost, read and modify the same data, the Modification result of one user destroys another

File Cache, database cache, optimized SQL, data shunting, horizontal and vertical division of database tables, and optimized code structure!

Summary of lock statements
I. Why should I introduce locks?
When multiple users perform concurrent operations on the database, the following data inconsistency occurs:

Update loss
A and B read and modify the same data. The Modification result of one user destroys the Modification result of another user, such as the ticket booking system.

Dirty read
User A modified the data, and user B then read the data again. However, user A canceled the data modification and restored the original value for some reason, the data obtained by B is inconsistent with the data in the database.

Non-repeated read
User A reads the data, and user B then reads the data and modifies the data. At this time, user A reads the data again and finds that the values of the first and second times are inconsistent.

The main method of concurrency control is blocking. The lock is to prohibit users from performing some operations within a period of time to avoid data inconsistency.

Binary lock Classification
There are two lock types:
1. From the perspective of the database system: exclusive locks (exclusive locks), shared locks, and update locks
MS-SQL Server uses the following resource lock modes.
Lock mode description
Share (S) is used for operations without changing or updating data (read-only operations), such as SELECT statements.
Update (U) is used in updatable resources. It prevents common deadlocks when multiple sessions are reading, locking, and subsequent resource updates.
Arrange it (X) for data modification operations, such as INSERT, UPDATE, or DELETE. Make sure that multiple updates are not performed for the same resource at the same time.
Intention locks are used to establish a lock hierarchy. The intention lock type IS: Intention sharing (IS), intention ranking (IX), and intention ranking sharing (SIX ).
The schema lock is used to perform operations dependent on the table schema. The schema lock types are: schema modification (Sch-M) and schema stability (Sch-S ).
Large-capacity Update (BU) is used to copy data to a table in large capacity and specify the TABLOCK prompt.

Shared lock
The share (S) Lock allows concurrent transactions to read (SELECT) a resource. When a shared (S) lock exists on the resource, no other transactions can modify the data. Once the data has been read, the shared (S) lock on the resource is released immediately, unless the transaction isolation level is set to repeated read or higher, or use the lock prompt to keep the share (S) Lock within the transaction lifecycle.

Update lock
Update (U) locks can prevent normal deadlocks. Generally, the update mode is composed of a transaction. The transaction reads the record, obtains the share (S) lock of the resource (page or row), and then modifies the row, this operation requires that the lock be converted to an exclusive (X) Lock. If two transactions obtain the Shared Mode Lock on the resource and attempt to update the data at the same time, a transaction attempts to convert the lock to the lock (X. The conversion from the sharing mode to the exclusive lock must wait for a while, because the exclusive lock of a transaction is incompatible with the Sharing Mode Lock of other transactions; a lock wait occurs. The second transaction attempts to obtain the row lock (X) for update. Because both transactions need to be converted to the exclusive (X) lock, and each transaction waits for another transaction to release the share mode lock, a deadlock occurs.

To avoid this potential deadlock problem, use the update (U) Lock. Only one transaction can obtain the resource Update (U) Lock at a time. If the transaction modifies the resource and the Hong Kong server is rented, the update (U) Lock is converted to the row (X) Lock. Otherwise, the lock is converted to a shared lock.

Exclusive lock
Locking (X) prevents concurrent transactions from accessing resources. Other transactions cannot read or modify the data locked by the lock (X.

Intention lock
The intention lock indicates that SQL Server needs to obtain the share (S) lock or arrange it (X) Lock on some underlying resources in the hierarchy. For example, a table-level share intention lock indicates that the transaction intends to place the share (S) lock on the page or row of the table. Setting the intention lock at the table level can prevent another transaction from getting the row lock (X) on the table containing that page. Intention locks can improve performance, because SQL Server only checks intention locks at the table level to determine whether transactions can safely obtain the locks on the table. Instead of checking the locks on each row or page in the table to determine whether the transaction can lock the entire table.

Intention locks include intention sharing (IS), intention arranging it (IX), and intention sharing (SIX ).

Lock mode description
By placing the S lock on each resource, intention sharing (IS) indicates that the transaction intends to read some (not all) of the underlying resources in the hierarchy.
By placing the X lock on each resource, the intention of the transaction is to modify some (rather than all) underlying resources in the hierarchy. Ix is the superset of IS.
By placing an IX lock on each resource, SIX shares with the intention to indicate that the transaction intends to read all the underlying resources in the hierarchy and modify some (rather than all) of the underlying resources. Allow concurrent IS locks on top-level resources. For example, the table's SIX lock places a SIX lock on the table (the concurrency IS allowed), and the IX lock on the current modification page (the X lock on the modified row ). Although each resource can have only one SIX lock for a period of time, to prevent other transactions from updating resources, however, other transactions can read the underlying resources in the hierarchy by obtaining the table-level IS lock.

Exclusive lock: only the lock operation is allowed by the program. Other operations on the lock operation will not be accepted. When the data update command is executed, SQL Server automatically uses the exclusive lock. An exclusive lock cannot be applied to an object when other locks exist.
Shared lock: the shared lock can be read by other users, but other users cannot modify it. When executing Select, SQL Server will apply a shared lock to the object.
Update lock: When SQL Server is preparing to update data, it first locks the data object so that the data cannot be modified but can be read. When SQL Server determines to update data, the website space will automatically replace the update lock with an exclusive lock. When other locks exist on the object, the update lock cannot be applied to it.

2. From the programmer's perspective: Optimistic locks and pessimistic locks.
Optimistic lock: it relies entirely on the database to manage the lock.
Pessimistic lock: the programmer manages the lock processing on data or objects by himself.

The MS-SQLSERVER uses locks to implement pessimistic concurrency control among users who execute modifications simultaneously in the database

Granularity of three locks
The lock granularity is the size of the target to be blocked. If the lock granularity is small, the concurrency is high, but the overhead is large. If the lock granularity is large, the concurrency is low, but the overhead is small.

The lock granularity supported by SQL Server can be divided into rows, pages, keys, key ranges, indexes, tables, or databases to obtain locks.

Resource Description
RID row identifier. Used to lock a row in a table.
The row lock in the key index. Used to protect the key range in a serializable transaction.
Page 8 KB data page or index page.
A group of eight adjacent data pages or index pages in the extended Disk Area.
The entire table includes all data and indexes.
DB database.

4. Length of lock time

The lock hold duration is the time required to protect resources at the requested level.

The duration of the shared lock used to protect read operations depends on the transaction isolation level. When the default transaction isolation level of read committed is adopted, the shared lock is only controlled during page reading. During the scan, the lock is released only when the lock is obtained on the next page within the scan. If you specify the HOLDLOCK prompt or set the transaction isolation level to repeatable read or SERIALIZABLE, the lock will not be released until the transaction ends.

Based on the concurrency options set for the cursor, the cursor can obtain the scroll lock in the sharing mode to protect the extraction. The scroll lock is released only when the cursor is extracted or closed for the next time (whichever comes first. However, if HOLDLOCK is specified, the rolling lock is released until the transaction ends.

The exclusive lock used to protect updates will not be released until the transaction ends.
If a connection attempts to obtain a lock and the lock conflicts with the lock controlled by another connection, the connection attempting to obtain the lock will be blocked:

Release the conflicting lock and the connection obtains the requested lock.

The connection timeout interval has expired. By default, there is no timeout interval, but some applications set a timeout interval to prevent indefinite waiting.

5. Custom locks in SQL Server

1. Handle deadlocks and set deadlock priority

A deadlock occurs when multiple users apply for different blockages. The applicant has part of the blockages and waits for the blockages of other users.

SET DEADLOCK_PRIORITY can be used to control the session response mode when a deadlock occurs. If both processes lock data and wait until other processes release their own locks, each process can release its own locks, that is, deadlock occurs.

2. Process timeout and set the lock timeout duration.

@ LOCK_TIMEOUT returns the current lock timeout settings for the current session, in milliseconds