Categories:
.NET (357)
C (330)
C++ (184)
CSS (84)
DBA (2)
General (7)
HTML (4)
Java (574)
JavaScript (106)
JSP (66)
Oracle (114)
Perl (46)
Perl (1)
PHP (2)
PL/SQL (1)
RSS (51)
Software QA (13)
SQL Server (1)
Windows (1)
XHTML (173)
Other Resources:
Describe one simple rehashing policy.
Describe one simple rehashing policy.
✍: .fyicenter.com
The simplest rehashing policy is linear probing. Suppose a key K hashes to location i. Suppose other key occupies H[i]. The following function is used to generate alternative locations:
rehash(j) = (j + 1) mod h
where j is the location most recently probed. Initially j = i, the hash code for K. Notice that this version of rehash does not depend on K.
2012-04-16, 3415👍, 0💬
Related Topics:
Popular Posts:
What's the output of the following program? And why? #include main() { typedef union { int a; char b...
Rachel opened her math book and found that the sum of the facing pages was 245. What pages did she o...
How To Display a Past Time in Days, Hours and Minutes? - MySQL FAQs - Managing Tables and Running Qu...
I have 5 questions please give me the answer ,explanation,suggestions if any?? what is PMP(project m...
What's the difference between J2SDK 1.5 and J2SDK 5.0? There is no difference, Sun Microsystems just...
