Performance study of optimistic concurrency control schemes for distributed database systems
Date
1993
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Texas A&M University
Abstract
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.
Description
Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to [email protected], referencing the URI of the item.
Includes bibliographical references.
Includes bibliographical references.
Keywords
computer science., Major computer science.