A dynamic database reorganization algorithm
ACM Transactions on Database Systems (TODS)
Evaluation and selection of file organization—a model and system
Communications of the ACM
Application of an analytical model to evaluate storage structures
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Modeling and performance evaluation of physical data base structures
ACM '76 Proceedings of the 1976 annual conference
Analysis of indexed sequential and direct access file organizations
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
| Hi-index | 0.00 |
An algorithm is presented which determines the loading costs for the following file organizations: Sequential, Indexed Sequential, Direct, Multilist, and Inverted file structures. S. B. Yao has developed a hierarchical access model which provides a single model incorporating the above organizations. This model has been used for a dynamic reorganization algorithm, and performance evaluation of data base structures. This paper uses Yao's model as a basis for developing an algorithm to determine the loading costs for the above file organizations. The algorithm is illustrated through Multilist, Cellular, and Inverted file structures. Graphs are presented which illustrate the relationship between the loading costs for the various organizations and the size of the data base. These costs are important in determining the time to reorganize a file and to assist in determining the cost of moving from one organization to another.