第4章索引与散列.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Partitioned Hashing Hash values are split into segments that depend on each attribute of the search-key. (A1, A2, . . . , An) for n attribute search-key Example: n = 2, for customer, search-key being (customer-street, customer-city) search-key value hash value (Main, Harrison) 101 111 (Main, Brooklyn) 101 001 (Park, Palo Alto) 010 010 (Spring, Brooklyn) 001 001 (Alma, Palo Alto) 110 010 To answer equality query on single attribute, need to look up multiple buckets. Similar in effect to grid files. Sequential File For account Records Sample account File * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Example of Hash Index Deficiencies of Static Hashing静态散列的缺点 In static hashing, function h maps search-key values to a fixed set of B of bucket addresses Databases grow with time, If initial number of buckets is too small, performance will degrade due to too much overflows If file size at some point in the future is anticipated and number of buckets allocated accordingly, significant amount of space will be wasted initially Deficiencies of Static Hashing静态散列的缺点 If database shrinks, again space will be wasted One option is periodic re-organization of the file with a new hash function, but it is very expensive These problems can be avoided by using techniques that allow the number of buckets to be modified dynamically 静态散列的缺点 如Hash(x)=X mod n, n=12, 12 是固定数，分为12桶 如果n太小，则很快不能满足需求；太大，则浪费空间 因此，随着数据增加或减少, n 应该动态变化 Dynamic Hashing动态散列 Good for database that grows and shrinks in size Allows the hash function to be modified dynamically Dynamic Hashing动态散列 Extendable hashing : one form of dynamic hashing Hash function generates values over a large range — typically b-bit integers, with b = 32 At any time use only a prefix of the hash function to index into a table of bucket addresses Let the length of the prefix be i bits, 0 ? i ? 32