Optimum reorganization points for linearly growing files

1 March 1978

journal article
Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems

Vol. 3 (1) , 32-40
https://doi.org/10.1145/320241.320244

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.

Keywords

GROWING FILES
LINEARLY GROWING
REORGANIZATION
FINDING OPTIMAL
RESULTS USING
APPROXIMATE POLICIES
PUBLISHED RESULTS

This publication has 2 references indexed in Scilit:

A dynamic database reorganization algorithm
ACM Transactions on Database Systems, 1976
Optimum data base reorganization points
Communications of the ACM, 1973