This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Alternating Hashing for Expansible Files
January-February 1997 (vol. 9 no. 1)
pp. 179-185

Abstract—In this paper, we propose a generalized approach for designing a class of dynamic hashing schemes which require no index and have the growth of a file at a rate of

$${\textstyle{{n\,+\,1} \over n}}$$per full expansion, where n is the number of pages of the file, as compared to a rate of two in linear hashing. Based on this generalized approach, we derive a new dynamic hashing scheme called alternating hashing, in which, when a split occurs in page k, the data records in page k will be redistributed to page k and page (k + 1), or page k and page (k− 1), according to whether the value of level d is even or odd, respectively. (Note that a level is defined as the number of full expansions happened so far.) From our performance analysis, given a fixed load control, the proposed scheme can achieve nearly 97% storage utilization as compared to 78% storage utilization by using linear hashing.

[1] J.H. Chu and G.D. Knott, "An Analysis of Spiral Hashing," The Computer J., vol. 37, no. 8, pp. 715-719, 1994.
[2] R.J. Enbody and H.C. Du, “Dynamic Hashing Schemes,” ACM Computing Surveys, vol. 20, no. 2, pp. 85-113, June 1988.
[3] N.I. Hachem and P.B. Berra, “New Order Preserving Access Method for Very Large Files Derived from Linear Hashing,” IEEE Trans. Knowledge and Data Eng., vol. 4, no. 1, pp. 68-82, Feb. 1992.
[4] R. Fagin, J. Nievergelt, N. Pippenger, and H.R. Strong, “Extendible Hashing—A Fast Access Method for Dynamic Files,” ACM Trans. Database Systems, vol. 4, no. 3, pp. 315-344, Sept. 1979.
[5] P. Larson, "Dynamic Hashing," BIT, vol. 18, pp. 184-201, 1978.
[6] P. Larson, "Linear Hashing with Partial Expansions," Proc. Sixth Int'l Conf. Very Large Data Bases, pp. 224-232, Oct. 1980.
[7] P. Larson, “A Single-File Version of Linear Hashing with Partial Expansions,” Proc. Eighth Int'l Conf. Very Large Data Bases, pp. 300-309, 1982.
[8] P. Larson, “Performance Analysis of Linear Hashing with Partial Expansions,” ACM Trans. Database Systems, vol. 7, no. 4, pp. 566-587, Dec. 1982.
[9] P. Larson and A. Kajla, “File Organization: Implementation of a Method Guaranteeing Retrieval in One Access,” ACM Computing Practices, vol. 27, no. 7, pp. 670-677, July 1984.
[10] P. Larson, “Linear Hashing with Overflow-Handling by Linear Probing,” ACM Trans. Database Systems, vol. 10, no. 1, pp. 75-89, Mar. 1985.
[11] P. Larson, “Linear Hashing with Separators—A Dynamic Hashing Scheme Achieving One-Access Retrieval,” ACM Trans. Database Systems, vol. 13, no. 3, pp. 366-388, Sept. 1988.
[12] C.I. Lee, "Design and Analysis of Dynamic Hashing Schemes Without Indexes," Master's Thesis, Dept. of Applied Mathematics, National Sun Yat-Sen Univ., R.O.C, June, 1993.
[13] W. Litwin, "Linear Hashing: A New Tool for Files and Tables Addressing," Proc. Sixth Int'l Conf. Very Large Data Bases, pp. 212-223, Oct. 1980.
[14] G.N. Martin, “Spiral Storage: Incrementally Augmentable Hash Addressed Storage,” Theory of Computation Report, no. 27,Univ. of Warwick, Conventry, England, Mar. 1979.
[15] K. Ramamohanarao and J.W. Lloyd, "Dynamic Hashing Schemes," The Computer J., vol. 25, no. 4, pp. 478-485, 1982.
[16] K. Ramamohanarao, “Recursive Linear Hashing,” ACM Trans. Database Systems, vol. 9, no. 3, pp. 369-391, Sept. 1984.

Index Terms:
Access methods, dynamic storage allocation, file organization, file system management, hashing.
Citation:
Ye-In Chang, Chien-I Lee, "Alternating Hashing for Expansible Files," IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 1, pp. 179-185, Jan.-Feb. 1997, doi:10.1109/69.567061
Usage of this product signifies your acceptance of the Terms of Use.