Affiliation:
1. Bell Labs, Holmdel, NJ
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.
Publisher
Association for Computing Machinery (ACM)
Reference12 articles.
1. Cox D.R. Renewal Theory. Wiley New York 1962. Cox D.R. Renewal Theory. Wiley New York 1962.
2. Moments of the Time to Absorption in the Random Walk between a Reflecting and an Absorbing Barrier
3. An approximation for the busy period of the M/G/I queue using a diffusion model;HEYMAN D.P;J. Appl. Prob.,1973
4. Optimal policy for batch operations
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Aging Locality Awareness in Cost Estimation for Database Query Optimization;Lecture Notes in Computer Science;2016
2. Online reorganization of databases;ACM Computing Surveys;2009-07
3. Performance Analysis of Database Systems;Performance Evaluation: Origins and Directions;2000
4. Numerical Transform Inversion to Analyze Teletraffic Models;The Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks;1994
5. A generalized cost model for stochastic clearing systems;Computers & Operations Research;1993-01