Observations on optimistic concurrency control schemes
作者:
Highlights:
•
摘要
Optimistic concurrency control schemes allow uncontrolled access to shared data objects during transaction processing under the explicit assumption that read and write conflicts among transactions are rare events. Before a transaction commits, the DBMS has to validate that no conflict has occurred. Conflict resolution mainly relies on transaction abort.Two different optimistic concurrency control schemes are introduced and compared to each other. The problems of implementing such schemes and their implications on DBMS processing is investigated in some detail. A number of general properties of optimistic concurrency control schemes is derived, and their advantages and drawbacks w.r.t. two-phase locking approaches are discussed.
论文关键词:
论文评审过程:Received 18 April 1983, Revised 6 October 1983, Available online 10 June 2003.
论文官网地址:https://doi.org/10.1016/0306-4379(84)90020-6