Performance analysis of time-stamp ordering algorithms in database systems: the pure restarts case

Due to the complexity of the issues affecting the performance of concurrency control algorithms in database systems most studies adopt different approaches and make different assumptions. We propose the use of a unified mean value analytic approach to the performance analysis of concurrency control algorithms. In this paper, we apply this modeling approach to analyze the performance of time-stamp ordering algorithms. We then compare our results with those reported on two-phase locking and optimistic algorithms, and generate several conclusions and recommendations.<
>