Optimum data base reorganization points
- 1 June 1973
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 16 (6), 362-365
- https://doi.org/10.1145/362248.362267
Abstract
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.Keywords
This publication has 2 references indexed in Scilit:
- Optimizing binary trees grown with a sorting algorithmCommunications of the ACM, 1972
- Replacement of Randomly Deteriorating EquipmentManagement Science, 1963