基于语义可串行性的乐观并发控制算法

An Optmistic Concurrency Control Algorithm Based on Semantic Serializability

为了克服文献〔1〕所提出的两种用于实现语义可串行性并发控制算法的缺点 (即都对用户书写的事务提出了特殊的要求 ,从而增加了用户的负担 ) ,本文给出了一种基于乐观方法的并发控制算法 。

To overcome the drawback of the two concurrency control algorithms proposed in literature〔1〕, where they are used to ensure semantic serializability (The drawback is that they both bring forward special demand on the transactions written by the user and this adds burden on the user.), in this paper we present a concurrency control algorithm based on optimistic method and prove that the algorithm ensure that the history created by it is semantic serializable.