A measure of transaction processing power
Datamation
An approximate analysis of the LRU and FIFO buffer replacement schemes
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
ACM Transactions on Database Systems (TODS)
An efficient scheme for providing high availability
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Operating Systems Theory
An efficient scheme for providing high availability
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Recovery Analysis of Data Sharing Systems under Deferred Dirty Page Propagation Policies
IEEE Transactions on Parallel and Distributed Systems
Rapid Transaction-Undo Recovery Using Twin-Page Storage Management
IEEE Transactions on Software Engineering
Repeating History Beyond ARIES
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Performance Analysis of Database Systems
Performance Evaluation: Origins and Directions
Implementing performance competitive logical recovery
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
In this paper we examine the recovery time in a database system using a Write-Ahead Log protocol, such as ARIES [9], under the assumption that the buffer replacement policy is strict LRU. In particular, analytical equations for log read time, data I/O, log application, and undo processing time are presented. Our initial model assumes a read/write ratio of one, and a uniform access pattern. This is later generalized to include different read/write ratios, as well as a “hot set” model (i.e. x% of the accesses go to y% of the data). We show that in the uniform access model, recovery is dominated by data I/O costs, but under extreme hot-set conditions, this may no longer be true. Furthermore, since we derive anaytical equations, recovery can be analyzed for any set of parameter conditions not discussed here.