[go: nahoru, domu]

Jump to content

Non-lock concurrency control: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Comps (talk | contribs)
Is this article necessary, or any contribution?
Comps (talk | contribs)
optimistic cc
Line 17: Line 17:
See also
See also
* [[Concurrency pattern]]
* [[Concurrency pattern]]
* [[Optimistic concurrency control]] ''(should [[Optimistic concurrency control]] and Non-lock concurrency control be merged ?)''
* [[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]]
* [[InterBase]]
* [[Lock-free and wait-free algorithms]]
* [[Lock-free and wait-free algorithms]]

Revision as of 22:57, 24 February 2008

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

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

There are several non-lock concurrency control methods:

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