Thumbnail
Access Restriction
Subscribed

Author Bays, Carter
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Reallocation ♦ Deletions ♦ Hash code ♦ Dynamic storage ♦ Scatter storage
Abstract When the space allocation for a hash-coded table is altered, the table entries must be rescattered over the new space. A technique for accomplishing this rescattering is presented. The technique is independent of both the length of the table and the hashing function used, and can be utilized in conjunction with a linear reallocation of the table being rescattered. Moreover, it can be used to eliminate previously flagged deletions from any hash-coded table, or to change from one hashing method to another. The efficiency of the technique is discussed and theoretical statistics are given.
Description Affiliation: Univ. of South Carolina (Bays, Carter)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 16
Issue Number 1
Page Count 4
Starting Page 11
Ending Page 14


Open content in new tab

   Open content in new tab
Source: ACM Digital Library