Optimistic concurrency control: Difference between revisions

Revision as of 07:56, 14 March 2009

Revision as of 14:51, 19 May 2009

Line 1:

In [[computer science]], in the field of [[database]]s, '''optimistic concurrency control''' (OCC) is a [[concurrency control]] method used in [[relational database]]s without using [[Lock (computer science)|locklocking]]ing. It is commonly referred to as '''optimistic locking''', a reference to the non-exclusive locks that are created on the database.

Optimistic concurrency control is based on the assumption that most [[database transaction]]s don't conflict with other transactions, allowing OCC to be as permissive as possible in allowing transactions to execute.

Line 35:

==Web links==

*{{cite journal|title=On optimistic methods for concurrency control|journal=ACM Transactions on Database Systems|date=June 1981|first=H. T.|last=Kung|coauthors=John T. Robinson|volume=6|issue=2|pages=213-226|id={{doi|10.1145/319566.319567}}}}

* Enterprise JavaBeans, 3.0, By Bill Burke, Richard Monson-Haefel, Chapter 16. Transactions, Section 16.3.5. Optimistic Locking, Publisher: O'Reilly, Pub Date: May 16, 2006,Print ISBN-10: 0-596-00978-X,

==See also==

Line 44:

<!-- Interwikis -->

[[fa:کنترل همروندی خوشبینانه]]

[[he:בקרת מקביליות אופטימית]]