By Topic

Alternating hashing for expansible files

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ye-In Chang ; Dept. of Appl. Math., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan ; Chien-I Lee

Proposes 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 (n+1)/n per full expansion, where n is the number of pages of the file, as compared to a rate of 2 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 are redistributed to page k and page (k+1), or to page k and page (k-1), according to whether the value of level d is even or odd, respectively (d is defined as the number of full expansions that have 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% by using linear hashing

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:9 ,  Issue: 1 )