The theory of database concurrency control
The theory of database concurrency control
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
The serializability of concurrent database updates
Journal of the ACM (JACM)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Concurrency Control in Distributed Databases Through Time Intervals and Short-Term Locks
IEEE Transactions on Software Engineering
An Optimistic Locking Technique for Concurrency Control in Distributed Databases
IEEE Transactions on Software Engineering
Concurrency control for distributed multiversion databases through time intervals
CSC '91 Proceedings of the 19th annual conference on Computer Science
| Hi-index | 0.01 |
In this paper, a method for concurrency control in distributed DBMSs, called Permission Test Method is proposed. The PT method satisfies the basic requirements for concurrency control, that is, it executes the transactions in a serializable order, deadlocks do not appear and indefinite postponment is prevented by the method. In PT method, transactions, which are permitted to run, are not aborted unless a related site failure occurs. Furthermore, the complexity analysis indicates that the algorithm will work in a reasonable amount of time. The PT method provides more concurrency than the Basic Timestamp Ordering and Two-Phase Locking techniques.