Show simple item record

dc.creatorKim Lee, Hyunsoon
dc.descriptionDue 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, referencing the URI of the item.en
dc.descriptionIncludes bibliographical references.en
dc.description.abstractIn 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.en
dc.publisherTexas A&M University
dc.rightsThis thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use.en
dc.subjectcomputer science.en
dc.subjectMajor computer science.en
dc.titlePerformance study of optimistic concurrency control schemes for distributed database systemsen
dc.typeThesisen scienceen
dc.format.digitalOriginreformatted digitalen

Files in this item


This item appears in the following Collection(s)

Show simple item record

This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.

Request Open Access