Optimistic concurrency control with partial replication design

Abstract

This paper presents a performance comparison of optimistic concurrency control algorithms using a database design with partial replication. Most studies always assume total replication design, but this scenario is not valid when the network latency is high and with a high number of system sites. So, this paper presents the optimistic algorithms and the simulation results under different scenarios of network latency, number of sites and system load. Finally, the paper shows that partial replication design is a good alternative that improves system throughput.