Non-lock concurrency control: Difference between revisions

Content deleted Content added

Inline

Revision as of 20:16, 7 July 2008

In Computer Science, in the field of databases, non-lock concurrency control is concurrency control method used in relational databases without using locking.

There are several non-lock concurrency control methods:

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

@@ Line 1: / 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: / Line 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]]