Optimum reorganization points for linearly growing files
ACM Transactions on Database Systems (TODS)
A dynamic database reorganization algorithm
ACM Transactions on Database Systems (TODS)
Optimal policy for batch operations: backup, checkpointing, reorganization, and updating
ACM Transactions on Database Systems (TODS)
Database Reorganization—Principles and Practice
ACM Computing Surveys (CSUR)
Optimal reorganization of distributed space disk files
Communications of the ACM
Optimum data base reorganization points
Communications of the ACM
The average time until bucket overflow
ACM Transactions on Database Systems (TODS)
Performance analysis of checkpointing strategies
ACM Transactions on Computer Systems (TOCS)
Performance Analysis of Database Systems
Performance Evaluation: Origins and Directions
Online reorganization of databases
ACM Computing Surveys (CSUR)
| Hi-index | 0.01 |
As data are updated, the initial physical structure of a database is changed and retrieval of specific pieces of data becomes more time consuming. This phenomenon is called database degradation. In this paper two models of database degradation are described. Each model refers to a different aspect of the problem.It is assumed that transactions are statistically independent and either add, delete, or update data. The first model examines the time during which a block of data is filling up. The second model examines the overflows from a block of data, which essentially describes the buildup of disorganization. Analytical results are obtained for both models. In addition, several numerical examples are presented which show that the mean number of overflows grows approximately linearly with time. This approximation is used to devise a simple formula for the optimal time to reorganize a stochastically growing database.