Management information systems: conceptual foundations, structure, and development (2nd ed.)
Management information systems: conceptual foundations, structure, and development (2nd ed.)
A dynamic database reorganization algorithm
ACM Transactions on Database Systems (TODS)
A first order approximation to the optimum checkpoint interval
Communications of the ACM
Optimum data base reorganization points
Communications of the ACM
Information Systems
Security, Accuracy, and Privacy in Computer Systems
Security, Accuracy, and Privacy in Computer Systems
Design of on-Line Computer Systems
Design of on-Line Computer Systems
A decision-model for restart and recovery from errors in information processing systems
A decision-model for restart and recovery from errors in information processing systems
Optimal data storage and organization in computerized information processing systems subject to failures.
On the selection of efficient record segmentations and backup strategies for large shared databases
ACM Transactions on Database Systems (TODS)
Analysis of retrieval performance for records and objects using optical disk technology
ACM Transactions on Database Systems (TODS)
Performance evaluation of global reading of entire databases
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Comparative Analysis of Different Models of Checkpointing and Recovery
IEEE Transactions on Software Engineering
Impact of Checkpoint Latency on Overhead Ratio of a Checkpointing Scheme
IEEE Transactions on Computers
Optimal file designs and reorganization points
ACM Transactions on Database Systems (TODS)
A practical guide to the design of differential files for recovery of on-line databases
ACM Transactions on Database Systems (TODS)
Mathematical models of database degradation
ACM Transactions on Database Systems (TODS)
Performance analysis of checkpointing strategies
ACM Transactions on Computer Systems (TOCS)
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Modeling on-line rebalancing with priorities and executing on parallel database systems
CASCON '96 Proceedings of the 1996 conference of the Centre for Advanced Studies on Collaborative research
An architecture for fault tolerance in database systems
ACM '80 Proceedings of the ACM 1980 annual conference
An optimized backout mechanism for sequential updates
VLDB '79 Proceedings of the fifth international conference on Very Large Data Bases - Volume 5
On-the-fly, incremental, consistent reading of entire databases
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Data base system performance prediction using an analytical model (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Numerical computation algorithms for sequential checkpoint placement
Performance Evaluation
Online reorganization of databases
ACM Computing Surveys (CSUR)
An evaluation of checkpoint recovery for massively multiplayer online games
Proceedings of the VLDB Endowment
Online monitoring and visualisation of database structural deterioration
International Journal of Autonomic Computing
Performance implications of failures in large-scale cluster scheduling
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
| Hi-index | 0.00 |
Many database maintenance operations are performed periodically in batches, even in realtime systems. The purpose of this paper is to present a general model for determining the optimal frequency of these batch operations. Specifically, optimal backup, checkpointing, batch updating, and reorganization policies are derived. The approach used exploits inventory parallels by seeking the optimal number of items—rather than a time interval—to trigger a batch. The Renewal Reward Theorem is used to find the average long run costs for backup, recovery, and item storage, per unit time, which is then minimized to find the optimal backup policy. This approach permits far less restrictive assumptions about the update arrival process than did previous models, as well as inclusion of storage costs for the updates. The optimal checkpointing, batch updating, and reorganization policies are shown to be special cases of this optimal backup policy. The derivation of previous results as special cases of this model, and an example, demonstrate the generality of the methodology developed.