Mathematical models of database degradation
- 1 December 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 7 (4) , 615-631
- https://doi.org/10.1145/319758.319771
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- Optimal Policies for Data Base ReorganizationOperations Research, 1981
- Database Reorganization—Principles and PracticeACM Computing Surveys, 1979
- Optimum reorganization points for linearly growing filesACM Transactions on Database Systems, 1978
- Optimal policy for batch operationsACM Transactions on Database Systems, 1977
- Optimal reorganization of distributed space disk filesCommunications of the ACM, 1976
- A dynamic database reorganization algorithmACM Transactions on Database Systems, 1976
- Optimum data base reorganization pointsCommunications of the ACM, 1973
- Moments of the Time to Absorption in the Random Walk between a Reflecting and an Absorbing BarrierSIAM Review, 1970