William G. Tuel
Abstract
The problem of finding optimal reorganization intervals for linearly growing files is solved. An approximate reorganization policy, independent of file lifetime, is obtained. Both the optimum and approximate policies are compared to previously published results using a numerical example.
- 1 SHNEIDERMAN, B. Optimum data base reorganization points. Comm. ACM 16, 6 (June 1973), 362-365. Google Scholar
Digital Library
- 2 DAs, K.S., TWOREY, T.J., XND YAO, S.B. Reorganization points for filedesignswithnonlinear processing costs (abstract). Proc. Inter. Conf. Very Large Data Bases, Sept. 1975, pp. 516- 517 (available from ACM, New York).Google Scholar
- 3 LUENBERC.ER, D.G. Optimization by Vector Space Methods. Wiley, New York, 1969, pp. 216-221.Google Scholar
- 4 YAo, S.B., DAs, K.S., AND TEOa~Y, T.j. A dynamic database reorganization algorithm. ACM Trans. Database ,.gyst. 1, 2 (June 1976), 159-174. Google ScholarDigital Library
Index Terms
- Optimum reorganization points for linearly growing files
Recommendations
Optimal reorganization of distributed space disk files
In most database organizations, the cost of accessing the database will increase due to structural changes caused by updates and insertions. By reorganizing the database, the access costs can be reduced. A basic problem is to establish the proper ...
Optimal storage allocation for serial files
A computer system uses several serial files. The files reside on a direct-access storage device in which storage space is limited. Records are added to the files either by jobs in batch processing mode, or by on-line transactions. Each transaction (or ...
On Multiple Random Accesses and Physical Data Placement in Dynamic Files
In the study of data storage and retrieval involving secondary storage devices, for example, magnetic disks, a simplified model of storage that is often used is that each access takes a constant amount of time. However, if some information about the ...
Comments