Transaction management in the R* distributed database management system
ACM Transactions on Database Systems (TODS)
The Performance of Alternative Strategies for Dealing with Deadlocks in Database Management Systems
IEEE Transactions on Software Engineering
Conflict detection tradeoffs for replicated data
ACM Transactions on Database Systems (TODS)
An optimistic commit protocol for distributed transaction management
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Processing real-time transactions in a replicated database system
Distributed and Parallel Databases
Advances in real-time systems
Replication, consistency, and practicality: are these mutually exclusive?
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Analysis of Replication in Distributed Database Systems
IEEE Transactions on Knowledge and Data Engineering
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
IEEE Transactions on Knowledge and Data Engineering
Divergence Control for Epsilon-Serializability
Proceedings of the Eighth International Conference on Data Engineering
Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
| Hi-index | 0.00 |
Many concurrency control algorithms for distributed real-time database systems have been proposed. But there isn't a representative concurrency control algorithm for replication environment. In this paper, we propose an efficient concurrency control algorithm for distributed real-time database systems in replication environment. The main ideas of this paper are promoting priority and trading of data. Promoting priority is that the priority of the transaction that enters into voting phase is elevated. Trading of data is that a holder in the voting phase can lend holding data to other transactions. The proposed algorithm does not cause priority inversion. Therefore it decreases the ratio of restarting transactions and guarantees a transaction to commit at its maximum. Also to reduce blocking times of transactions, it permits data of a transaction in the voting phase to lend to the others. It is shown through the performance evaluation that the proposed algorithm outperforms the existing algorithms such as DO2PL_PA and MIRROR.