Multiversion concurrency control—theory and algorithms
ACM Transactions on Database Systems (TODS)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Distributed database concurrency controls using before-values
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A multi-version concurrency scheme with no rollbacks
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Performance of update algorithms for replicated data in a distributed database.
Performance of update algorithms for replicated data in a distributed database.
Performance analysis of distributed database systems
Performance analysis of distributed database systems
Performance evaluation of timestamp-driven databases
Performance evaluation of timestamp-driven databases
Performance results on multiversion timestamp concurrency control with predeclared writesets
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Performance models of timestamp-ordering concurrency control algorithms in distributed databases
IEEE Transactions on Computers
| Hi-index | 0.00 |
In this paper we present a new analytical model for performance measurements of timestamp driven databases. The model is based on two-dimensional Poisson processes where one coordinate represents the real arrival time and the other the timestamp of an arriving messages. The notion of preemption is defined which serves as a model for synchronization. Preemption naturally implies such performance measures as response time and amount of abortion in the system. The concept of oracle is introduced which allows evaluation of a lower bound on the synchronization cost. Preemption and the oracle are then used to evaluate performance of the Multiversion synchronization. We present the distribution and the expectation of the synchronization cost. The analysis is then applied to a database with exponential communication delays (&agr;) and the intensity of transaction &lgr;. It is shown that for Multiversion, this cost depends linearly on l/&agr; and logarithmically on &lgr;.