Concurrency control performance issues
Bruce I. Galler · 1982
Concurrency control methods are studied in two contexts: centralized and distributed database management systems. Models to study the performance of the many algorithms that have been proposed to keep databases consistent are presented. For the centralized case of heuristic analytical model is solved iteratively and results concerning optimal granularity are derived. A proof that for all reasonable systems the iteration converges is given. Additionally, a simple test that determines whether the point of convergence is unique is provided. Previous studies of the performance of concurrency control mechanisms in distributed database management systems have not considered workload characteristics or system constraints. These factors are incorporated into a framework that enables an easier choice of concurrency control algorithm for a distributed database management system. Finally, two distributed algorithms are compared using a simulation model and the effect of various system and workload parameters are investigated.