.NET C C++ CSS DBA General HTML Java JavaScript JSP JUnit MySQL Networking Oracle Perl Perl PHP PL/SQL RSS Software QA SQL Server Struts Unix Windows XHTML XML

Describe one simple rehashing policy.

Q

Describe one simple rehashing policy.

✍: .fyicenter.com

A

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, 3403👍, 0💬

.NET C C++ CSS DBA General HTML Java JavaScript JSP JUnit MySQL Networking Oracle Perl Perl PHP PL/SQL RSS Software QA SQL Server Struts Unix Windows XHTML XML