Issue No. 06 - November/December (1999 vol. 11)
ISSN: 1041-4347
pp: 969-984
ABSTRACT
<p><b>Abstract</b>—The goal of dynamic hashing is to design a function and a file structure that allow the address space allocated to the file to be increased and reduced without reorganizing the whole file. In this paper, we propose a new scheme for dynamic hashing in which the growth of a file occurs at a rate of <tmath>$\frac{n+k}{n}$</tmath> per full expansion, where <tmath>$n$</tmath> is the number of pages of the file and <tmath>$k$</tmath> is a given integer constant which is smaller than <tmath>$n$</tmath>, as compared to a rate of two in linear hashing. Like linear hashing, the proposed scheme (called linear spiral hashing) requires no index; however, the proposed scheme may or may not add one more physical page, instead of always adding one more page in linear hashing, when a split occurs. Therefore, linear spiral hashing can maintain a more stable performance through the file expansions and have much better storage utilization than linear hashing. From our performance analysis, linear spiral hashing can achieve nearly 97 percent storage utilization as compared to 78 percent storage utilization by using linear hashing, which is also verified by a simulation study.</p>
INDEX TERMS
Access methods, dynamic storage allocation, file organization, file system management, hashing.
CITATION
Ye-In Chang, Chien-I. Lee, Wann-Bay ChangLiaw, "Linear Spiral Hashing for Expansible Files", IEEE Transactions on Knowledge & Data Engineering, vol. 11, no. , pp. 969-984, November/December 1999, doi:10.1109/69.824617