Optimal file designs and reorganization points
- 1 March 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 7 (1) , 60-81
- https://doi.org/10.1145/319682.319696
Abstract
A model for studying the combined problems of file design and file reorganization is presented. New modeling techniques for predicting the performance evolution of files and for finding optimal reorganization points for files are introduced. Applications of the model to hash-based and indexed-sequential files reveal important relationships between initial loading factors and reorganization frequency. A practical file design strategy, based on these relationships, is proposed.Keywords
This publication has 8 references indexed in Scilit:
- B+ trees and indexed sequential filesPublished by Association for Computing Machinery (ACM) ,1981
- Database Reorganization—Principles and PracticeACM Computing Surveys, 1979
- Optimum reorganization points for linearly growing filesACM Transactions on Database Systems, 1978
- Optimal policy for batch operationsACM Transactions on Database Systems, 1977
- An attribute based model for database access cost analysisACM Transactions on Database Systems, 1977
- A dynamic database reorganization algorithmACM Transactions on Database Systems, 1976
- A practitioner's guide to addressing algorithmsCommunications of the ACM, 1976
- Optimum data base reorganization pointsCommunications of the ACM, 1973