数据结构c语言版李建中版pptchapter8课件.ppt

CHAPTER 8;Symbol Table;The ADT of Symbol Table;Search vs. Hashing;Static Hashing;Identifier Density and Loading Density;Synonyms;Overflow and Collision;Example;Hashing Functions;M = 2i fD(X) depends on LSBs of X Example. (1) Each character is represented by six bits. (2) Identifiers are right-justified and zero-filled. 000000A1 = … 000001011100 000000B1 = … 000010011100 000000C1 = … 000011011100 00000X41 = … 011000011100 00NTXY1 = … 011000011001011100;(3) Identifiers are left-justified and zero-filled. 60-bit word ;Programs in which many variables are permutations of each other. Example. X=X1X2 Y=X2X1 X1 -- C(X1) X2 -- C(X2) Each character is represented by six bits X: C(X1) * 26 + C(X2) Y: C(X2) * 26 + C(X1) (fD(X) - fD(Y)) % P (where P is a prime number) = C(X1) * 26 % P + C(X2) % P - C(X2) * 26 % P- C(X1) % P P = 3 64 % 3 * C(X1) % 3 + C(X2) % 3 - 64 % 3 * C(X2) % 3- C(X1) % 3 = C(X1) % 3 + C(X2) % 3 - C(X2) % 3- C(X1) % 3 = 0 P = 7? M is a prime number such that M does not divide rk?a for small k and a (Knuth) for example, M = 1009 ;Hashing Functions ;P1;Digital Analysis;Overflow Handling;Data Structure for Hash Table;Hash Algorithm via Division;Example;Linear Probing(linear open addressing);Linear Probing;Problem of Linear Probing;Coalesce Phenomenon;Quadratic Probing;rehashing;Data Structure for Chaining;Chain Insert;Results of Hash Chaining;暇杨邪筛琳渠鹿利举魔旺遣砌咕敛仑粒常敲地窍八痒聋掩风教桂洼忽跃蟹数据结构c语言版李建中版pptchapter8课件数据结构c语言版李建中版pptchapter8课件;dynamic hashing(extensible hashing);*Figure 8.8:Some identifiers requiring 3 bits per character(p.414) ;*Figure 8.9: A trie to hole identifiers(p.415);Extendiable Hashing;If keys do not uniformly divide up among pages, then the directory can glow quite large, but most of entries will point