New analytic models are presented which predict the maximum throughput of locking and optimistic concurrency control algorithms for a centralized database ...
ABSTRACT. This paper describes a study of the performance of cen- tralized concurrency control algorithms. An algorithm-independent simulation framework.
We examine three concurrency control algorithms in this study, two locking ... locking was found to outperform the immediate-restart and optimistic algorithms.
This paper focuses on two-phase locking as a means to ensure correctness and database integrity when it is updated by several transactions concurrently in a ...
The two approaches produce different effects on hardware resource contention and data contention. Compared with locking, the OCC scheme is vulnerable to ...
... evaluation of lock-based and optimistic approaches for conflict management among concurrent transactions . For these classical concurrency control ...
Nov 9, 2001 · “Performance analysis of locking and optimistic concurrency control algorithms,” Performance Evaluation 5,2 (1985), 105–118. Article Google ...
The empirical results obtained show that the performance of optimistic concurrency control techniques can be significantly improved by using a relatively small ...
People also ask
When should optimistic concurrency methods be used for concurrency control?
What is optimistic algorithm for concurrency control?
What are the advantages of optimistic concurrency control?
What is pessimistic concurrency?
A performance analysis of standard locking is provided and several two-phase processing methods are described and shown to outperform restart-oriented ...
Missing: Algorithms. | Show results with:Algorithms.
Many performance studies have shown that locking based protocols outperform other concurrency control protocols in most database configurations and workloads.