| Concurrency Control |
Article Index for Concurrency |
Website Links For Control |
Information About ™Concurrency Control |
| CATEGORIES ABOUT CONCURRENCY CONTROL | |
| concurrency control | |
| # | |
| data management | |
| databases | |
| transaction processingconcurrency control | |
| # | |
| data management | |
| databases | |
| transaction processing | |
| data management | |
| operating system technology | |
| concurrency | |
|
In Computer Science -- in the field of Concurrent Programming (see also Parallel Programming and Parallel Computing on Multiprocessor machines) -- concurrency control is a method used to ensure that correct results are generated, while getting those results as quickly as possible. Several algorithms can be used for either type of concurrency control (i.e., with in-RAM data structures on systems that have no database, or with on-disk databases). Transaction ACID rules
Concurrency control mechanism The main categories of concurrency control mechanisms are:
There are many methods for concurrency control, the majority of which uses Strict 2PL locking:
Locks are bookkeeping objects associated with a database object. There are also Non-lock Concurrency Control methods. All the currently implemented lock-based and almost all the implemented non-lock based concurrency controls will guarantee that the resultant schedule is Conflict Serializable ; however, there are many academic texts encouraging View Serializable schedules for environments where gains due to improvement in concurrency outstrip overheads in generating schedule plans. SEE ALSO EXTERNAL LINKS
|
|
|