The performance of multiversion concurrency control algorithms
ACM Transactions on Computer Systems (TOCS)
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
Database Concurrency Control: Methods, Performance, and Analysis
Database Concurrency Control: Methods, Performance, and Analysis
Implementation of a Virtual Time Synchronizer for Distributed Databases
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
T3C: A Temporally Correct Concurrency Control Algorithm for Distributed Databases
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
A Risk-Free Multiversion Temporally Correct Algorithm
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Delayed-Initiation Risk-Free Multiversion Temporally Correct Algorithm (Research Note)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
| Hi-index | 0.00 |
In this paper we present a concurrency control algorithm and recovery protocol for distributed databases that produces a schedule that is equivalent to that of a temporally ordered serial schedule. The algorithm is intended to be somewhat practical from the standpoints of both burden on the application developer and realism of the network environment. Accordingly, it allows transactions to be received out of order within a window of tolerance. Moreover, it doesn't require declaration of readsets, and writesets are declared simply at the table level and without predicates. This paper discusses the algorithm, present its analytical studies, and report on the simulation experiments we carried out to evaluate the performance of ours scheme. Our results clearly indicate that with predeclared tables, performance is greatly improved as compared with that from the conservative MVTO algorithm.