Non-lock concurrency control: Difference between revisions
Content deleted Content added
Fun Tags: Reverted Mobile edit Mobile web edit |
Dialectric (talk | contribs) m Reverted edits by 2401:4900:4E08:BE8A:F5C2:8794:C151:A19 (talk) to last version by Addbot |
||
| Line 1: | Line 1: | ||
{{Unreferenced|date=December 2009}} |
{{Unreferenced|date=December 2009}} |
||
In [[Computer Science]], in the field of [[database]]s, '''non-lock concurrency control''' is a |
In [[Computer Science]], in the field of [[database]]s, '''non-lock concurrency control''' is a [[concurrency control]] method used in [[relational database]]s without using [[lock (computer science)|locking]]. |
||
# Dimple. used in [[relational database]]s without using [[lock (computer science)|locking]]. |
|||
There are several non-lock concurrency control methods, which involve the use of timestamps on transaction to determine transaction priority: |
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]] |
|||
Type Dasari Charitha reddy |
|||
* [[Multiversion concurrency control]] |
|||
#Dimple# |
|||
==See also== |
==See also== |
||
Revision as of 22:50, 24 February 2021
 |
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:
See also
 | This database-related article is a stub. You can help Wikipedia by expanding it. |