Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
The Performance of Alternative Strategies for Dealing with Deadlocks in Database Management Systems
IEEE Transactions on Software Engineering
A theory of reliability in database systems
Journal of the ACM (JACM)
ACM Transactions on Database Systems (TODS)
Semantics-based concurrency control: beyond commutativity
ACM Transactions on Database Systems (TODS)
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
Locks with constrained sharing (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The serializability of concurrent database updates
Journal of the ACM (JACM)
Consistency in Hierarchical Database Systems
Journal of the ACM (JACM)
Locking Primitives in a Database System
Journal of the ACM (JACM)
Recovery Techniques for Database Systems
ACM Computing Surveys (CSUR)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Data Structures and Algorithms
Data Structures and Algorithms
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Modeling and evaluation of database concurrency control algorithms
Modeling and evaluation of database concurrency control algorithms
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
A Transaction Model to Improve Data Availability in Mobile Computing
Distributed and Parallel Databases
Ordered shared locks for real-time databases
The VLDB Journal — The International Journal on Very Large Data Bases
A Performance Comparison of Locking Methods with Limited Wait Depth
IEEE Transactions on Knowledge and Data Engineering
Speculative Lock Management to Increase Concurrency in Mobile Environments
MDA '99 Proceedings of the First International Conference on Mobile Data Access
Speculative Locking Protocols to Improve Performance for Distributed Database Systems
IEEE Transactions on Knowledge and Data Engineering
Asynchronous group mutual exclusion
Distributed Computing
Can-Follow Concurrency Control
IEEE Transactions on Computers
Reducing Rollbacks of Transactional Memory Using Ordered Shared Locks
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Improving the performance of read-only transactions through speculation
DNIS'07 Proceedings of the 5th international conference on Databases in networked information systems
Speculation-based protocols for improving the performance of read-only transactions
International Journal of Computational Science and Engineering
| Hi-index | 0.00 |
There is growing evidence that for a wide variety of database workloads and system configurations, locking-based concurrency control outperforms other types of concurrency control strategies. However, in the presence of increased data contention, locking protocols such as two-phase locking perform poorly. In this paper, we analyze a family of locking-based protocols that employ a new relationship between locks called ordered sharing. Using a centralized database simulation model, we demonstrate that these protocols exhibit comparable performance to that of traditional locking-based protocols when data contention is low, and they exhibit superior performance when data contention is high. Furthermore, we show that the performance of these protocols improves as resources become more plentiful. This is particularly significant because the performance of two-phase locking degrades as a result of data contention, not resource contention. Thus, introducing additional resources improves the performance of the proposed protocols, though it does not benefit two-phase locking significantly.