Non-lock concurrency control: Difference between revisions

Revision as of 22:57, 24 February 2008

Revision as of 20:16, 7 July 2008

Line 1:

In [[Computer Science]], in the field of [[database]]s, '''non-lock concurrency control''' is [[concurrency control]] method used in [[relational database]]s without using [[lock (computer science)|locking]].

(+++Applicable to all database types, not just relational +++)

There are several non-lock concurrency control methods:

Line 9 ⟶ 7:

* [[Multiversion concurrency control]]

They involve the use of timestamps on transaction to determine transaction priority.

(+++Not all these methods necessariliy use timestamps+++ Article looks redundant. +++)

(+++Validity of a separate article for this subject is questionable, since each method is unique, and not much in common. Why not an article on "non timestamp CC?" +++)

See also

* [[Concurrency pattern]]

* [[Optimistic concurrency control]]

* [[Optimistic concurrency control]] ''(should [[Optimistic concurrency control]] and Non-lock concurrency control be merged ? No. Non-lock does not imply optimistic, and vice-versa. See definition of optimistic)''

* [[InterBase]]

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