The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (1985 vol.11)
pp: 564-572
N. Griffyth , School of Information and Computer Science, Georgia Institute of Technology
ABSTRACT
The performance modeling described in this paper compares several protocols which ensure that a database can be recovered to a consistent state after a transaction failure or system crash. The contributions of the paper include a collection of simple analytic models, based on Markov processes, for these protocols and some surprising results on the relative performance of the protocols. We consider only two-stage transactions (all reads before writes) and ignore effects of serializing transactions. The most interesting performance result presented is that, for systems obeying the assumptions of this paper, the "pessimistic" policy of holding write locks to commit point is considerably less efficient than the "optimistic" policy which allows reading of uncommitted data, but risks cascading aborts. A multiversion policy introduced in [2] was also studied and found always to be nearly as good as the optimistic policy and sometimes much better.
INDEX TERMS
transaction systems, Atomic actions, concurrency control, database systems, Markov processes, performance modeling, queueing models, reliability
CITATION
N. Griffyth, J.A. Miller, "Performance Modeling of Database Recovery Protocols", IEEE Transactions on Software Engineering, vol.11, no. 6, pp. 564-572, June 1985, doi:10.1109/TSE.1985.232494
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool