Home → Magazine Archive → June 1973 (Vol. 16, No. 6) → Optimum data base reorganization points → Abstract

Optimum data base reorganization points

By Ben Shneiderman

Communications of the ACM, Vol. 16 No. 6, Pages 362-365

In certain data base organization schemes the cost per access may increase due to structural inefficiencies caused by update. By reorganizing the data base the cost per access may be reduced. However, the high cost of a reorganization prohibits frequent reorganizations. This paper examines strategies for selecting the optimum reorganization points.

The full text of this article is premium content


No entries found