Linear hashing: Difference between revisions

Content deleted Content added
Hash functions: added segregated headings and minor reformatting
Tags: Mobile edit Mobile app edit Android app edit
Typical hashing function: removed N from the formula because N rarely has influence on the hashing function
Tags: Mobile edit Mobile app edit Android app edit
Line 43:
 
====Typical hashing function====
A typical example uses the division modulo x operation in which a record corresponds to a bucket in which all the keys have the same rightmost binary digits. In this example, the value of <math>i</math> in <math>h_i</math> corresponds to the number of rightmost digits that are used to segregate the buckets. If the original number of buckets is <math>N</math> (Usually <math>N=1</math>), then theThe family of hash functions is
 
<math> h_i(c) \mapsto c \pmod{N \cdot 2^i}</math>.<ref name="LMS" />
 
====Determining the hashing function for a key====