Self-organizing scheme for file storage

  • Authors:

  • Yuan Y. Sung;Donghoon Lee

  • Affiliations:

  • Department of Mathematical Science, Memphis State University, Memphis, TN;School of Electrical Engineering and Computer Sciences, University of Oklahoma, Norman, OK

  • Venue:
  • CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

The B-tree data structure of Bayer and McCreight is an effective method of organizing an external file when the operations of searching, insertion, and deletion must be supported since these operations on B-tree require at most logarithmic time of the file size.The performance of B-trees can be improved by reorganizing file storage, as the environment of a file changes. Three parameters are used, in order to reorganize file storage and adapt to the changing environment of a file. The space utilization of B-trees and the number of disk accesses are analyzed by dynamically adjusting three parameters. The simulation results are given which indicate that the performance of B-trees is significantly improved by increasing the space utilization to some degree, especially when the file is static. Also when a file is highly dynamic, the improvement in the performance of B-trees is discernible as two sensitivity factors are increased from 0 to the range of 0.05 - 0.1. A near optimal range for each parameter is proposed to maintain a high performance as the environment of a file changes.