Locking performance in centralized databases
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Performance Analysis of Dynamic Locking with the No-Waiting Policy
IEEE Transactions on Software Engineering
Conflict detection tradeoffs for replicated data
ACM Transactions on Database Systems (TODS)
Efficient optimistic concurrency control using loosely synchronized clocks
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Distributed Concurrency Control Based on Limited Wait-Depth
IEEE Transactions on Parallel and Distributed Systems
Basic Timestamp, Multiple Version Timestamp, and Two-Phase Locking
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Efficient and Accurate Ethernet Simulation
LCN '99 Proceedings of the 24th Annual IEEE Conference on Local Computer Networks
Distributed Transaction Processing on an Ordering Network
Distributed Transaction Processing on an Ordering Network
Hi-index | 0.00 |
Popular conception has been that timestamp ordering concurrency control (CC) yields poor transaction processing performance in relation to two-phase locking (2PL). This paper makes two contributions. First, we show the surprising result that Basic Timestamp Ordering (BTO) performs better than 2PL in all cases except when both data contention and message latency are low. When latency or data contention is high, BTO significantly outperforms 2PL. Our second contribution is a new timestamp ordering CC technique (PREDICT) that performs better than 2PL and BTO under low data contention, and continues to perform well under high data contention. We evolve a set of variants of PREDICT, and demonstrate that PREDICT achieves a good balance between lost opportunity cost and restart cost, and outperforms popular CC techniques.