Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
Parallelism and concurrency control performance in distributed database machines
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Analysis of database performance with dynamic locking
Journal of the ACM (JACM)
`PRABHA'—a distributed concurrency control algorithm
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Performance Analysis of Two-Phase Locking
IEEE Transactions on Software Engineering
An Efficient Deadlock Avoidance Technique
IEEE Transactions on Computers
An approach to eliminate transaction blocking in locking protocols
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
Hierarchical, Adaptive Cache Consistency in a Page Server OODBMS
IEEE Transactions on Computers
The Performance of Two Phase Commit Protocols in the Presence of Site Failures
Distributed and Parallel Databases
Load control for locking: the “half-and-half” approach
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Deadlock detection in a multidatabase
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Overview of multidatabase transaction management
The VLDB Journal — The International Journal on Very Large Data Bases
Ordered shared locks for real-time databases
The VLDB Journal — The International Journal on Very Large Data Bases
The Performance of Protocols Based on Locks with Ordered Sharing
IEEE Transactions on Knowledge and Data Engineering
A Performance Comparison of Locking Methods with Limited Wait Depth
IEEE Transactions on Knowledge and Data Engineering
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
IEEE Transactions on Knowledge and Data Engineering
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Performance Analysis of Concurrency Control Methods
Performance Evaluation: Origins and Directions
An Efficient Distributed Concurrency Control Algorithm Using Two Phase Priority
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
The VLDB Journal — The International Journal on Very Large Data Bases
Performance modeling of nested transactions in database systems
CASCON '00 Proceedings of the 2000 conference of the Centre for Advanced Studies on Collaborative research
Non-blocking concurrency control in distributed database systems
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Overview of multidatabase transaction management
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
Serializable isolation for snapshot databases
ACM Transactions on Database Systems (TODS)
Scalable data storage in project Darkstar
Scalable data storage in project Darkstar
Overview of multidatabase transaction management
CASCON First Decade High Impact Papers
| Hi-index | 0.01 |
There is growing evidence that, for a fairly wide variety of database workloads and system configurations, locking is the concurrency control strategy of choice. With locking, of course, comes the possibility of deadlocks. Although the database literature is full of algorithms for dealing with deadlocks, very little in the way of practical performance information is available to a database system designer faced with the decision of choosing a good deadlock resolution strategy. This paper is an attempt to bridge this gap in our understanding of the behavior and performance of alternative deadlock resolution strategies. We employ a simulation model of a database environment to study the relative performance of several strategies based on deadlock detection, several strategies based on deadlock prevention, and a strategy based on timeouts. We show that the choice of the best deadlock resolution strategy depends upon the level of data contention, the resource utilization levels, and the types of transactions. We provide guidelines for selecting a deadlock resolution strategy for different operating regions.