Performance study of optimistic concurrency control schemes for distributed database systems /
In distributed database systems, a concurrency control mechanism is needed to coordinate accesses to the same data items by more than one transactions for data consistency. There are two basic approaches to the concurrency control problem: conservative and optimistic. In conservative concurrency co...
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1993.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | In distributed database systems, a concurrency control mechanism is needed to coordinate accesses to the same data items by more than one transactions for data consistency. There are two basic approaches to the concurrency control problem: conservative and optimistic. In conservative concurrency control, transactions can not proceed unless there is guarantee for consistency. In optimistic concurrency control, inconsistency is temporarily allowed and is rectified when a transaction tries to commit. This thesis studies optimistic concurrency control algorithms, observes their performances and overheads under various environments through extensive simulation. |
|---|---|
| Item Description: | "Major Subject: Computer Science". Vita. |
| Physical Description: | viii, 55 leaves : illustrations ; 28 cm. Also available online. |
| Bibliography: | Includes bibliographical references. |