Performance Evaluation of Centralized Databases with Static Locking
IEEE Transactions on Software Engineering
Locking performance in centralized databases
ACM Transactions on Database Systems (TODS)
Performance models of timestamp-ordering concurrency control algorithms in distributed databases
IEEE Transactions on Computers
Perfornance Study of Two Phase Locking in Single-Site Database Systems
IEEE Transactions on Software Engineering
Performance analysis of an algorithm for concurrency control in replicated database systems
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Analysis of some optimistic concurrency control schemes based on certification
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
On the modeling of parallel access to shared data
Communications of the ACM
Design and Analysis of Integrated Concurrency-Coherence Controls
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
A decomposition solution to the queueing network model of the centralized DBMS with static locking
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A simple analysis of exclusive and shared lock contention in a database system
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Performance of update algorithms for replicated data in a distributed database.
Performance of update algorithms for replicated data in a distributed database.
Concurrency control performance issues
Concurrency control performance issues
A mean value performance model for locking in databases
A mean value performance model for locking in databases
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
A concurrency control model for PDM systems
Computers in Industry
| Hi-index | 0.00 |
The author analyzes and compares the performance of two timestamp ordering concurrency control algorithms, namely, the basic and multiversion, for database systems. The multiversion algorithm improves the performance of the basic timestamp ordering algorithm by keeping multiple versions of data objects. The author discusses the performance enhancement in the multiversion algorithm over the basic algorithm. The author also discusses the storage overhead due to multiple versions of data objects in the multiversion algorithm. The exact performance model of these algorithms is so complex that it is impossible to find a closed-form solution. The author reduces the complexity of the analysis by analyzing a single transaction in isolation and reflects the presence of other transactions on the isolated transaction by the probability of conflict/abort. The analysis provides useful insight into the performance of these algorithms.