Non-lock concurrency control: Difference between revisions

Revision as of 16:30, 19 February 2021

Latest revision as of 17:44, 13 June 2025

(9 intermediate revisions by 7 users not shown)

Line 1:

{{UnreferencedMore citations needed|date=DecemberJune 20092025}}

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]].

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]]<ref>{{Cite book |last= |first= |url=https://www.google.co.uk/books/edition/Introduction_to_Database_Systems/y7P9sa2MeGIC?hl=en&gbpv=1&dq=%22Non-lock+concurrency+control%22+-wikipedia&pg=PA330&printsec=frontcover |title=Introduction to Database Systems |date=September 2010 |publisher=Pearson Education India |isbn=978-81-317-3192-5 |page=341 |language=en}}</ref>

Type Dasari Charitha reddy

** Validation-based concurrency control

#Dimple#

** [[Multiversion concurrency control]]

*** [[Snapshot isolation]]

==See also==

Line 13 ⟶ 16:

* [[Lock-free and wait-free algorithms]]

== References ==

{{DEFAULTSORT:Non-Lock Concurrency Control}}

[[Category:Concurrency control]]

[[Category:Transaction processing]]

{{Reflist}}{{Database-stub}}

{{Database-stub}}