Hashing:the Idea Very large,but only a In feasible size small part is used in an application at a certain E[0] ·Index distribution time 耳1] Collision handling : Hash Function Key Space E[k] H(x)=k Value of a A calculated specific key array index for E[m-1] the keyHashing: the Idea Key Space Hash Function E[0] E[1] E[m-1] Value of a specific key A calculated array index for the key Very large, but only a small part is used in an application at a certain time In feasible size • Index distribution • Collision handling E[k] x H(x)=k