Non-lock concurrency control: Difference between revisions
Content deleted Content added
m Reverted edits by 2600:8800:4D00:1900:D925:9988:4C20:4215 (talk) (HG) (3.4.10) |
Fixed indentation because timestamp and validation are both types of optimistic concurrency control |
||
| Line 5: | Line 5: | ||
* [[Optimistic concurrency control]] |
* [[Optimistic concurrency control]] |
||
* [[Timestamp-based concurrency control]] |
** [[Timestamp-based concurrency control]] |
||
** Validation-based concurrency control |
|||
* [[Multiversion concurrency control]] |
* [[Multiversion concurrency control]] |
||
** [[Snapshot isolation]] |
|||
==See also== |
==See also== |
||
Revision as of 21:48, 30 November 2023
 |
In Computer Science, in the field of databases, non-lock concurrency control is a concurrency control method used in relational databases without using locking.
There are several non-lock concurrency control methods, which involve the use of timestamps on transaction to determine transaction priority:
- Optimistic concurrency control
- Timestamp-based concurrency control
- Validation-based concurrency control
- Multiversion concurrency control
See also
 | This database-related article is a stub. You can help Wikipedia by expanding it. |