This approach guarantees some isolation, but scales well and works particularly well in read-frequently write-sometimes situations. When your application uses long transactions or conversations that span several database transactions, you can store versioning data, so that if the same entity is updated by two transactions, to commit the modification changed by last transaction is informed of the conflict, and does not override the other transaction’s work. If conflicting modification is revealed, then the committing transaction rolls back. Before committing, each transaction verifies that no other transaction has modified its data.Transactions can proceed without locking the data resources that they affect.Multiple transactions can complete without affecting each other.There are mainly two types of locking strategy available – optimistic and pessimistic Optimistic Locking refers to a mechanism taken for granted in a relational database to prevent any modification to the data between the time the data are read and the time the data are used.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |