10-HashTable知识讲稿.pptVIP

Hashing Algorithm : Design Analysis [10] In the last class… Implementing Dictionary ADT Definition of red-black tree Black height Insertion into a red-black tree Deletion from a red-black tree Hashing Hashing Collision Handling for Hashing Closed Address Hashing Open Address Hashing Hash Functions Array Doubling and Amortized Analysis Hashing: 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 In feasible size Index distribution Collision handling E[k] x H(x)=k Collision Handling: Closed Address k1 k7 k2 k5 k3 k6 k4 k1 k5 k2 k4 k3 k7 k6 Each address is a linked list Closed Address: Analysis Assumption: simple uniform hashing: for j=0,1,2,...,m-1, the average length of the list at E[j] is n/m. The average cost of an unsuccessful search: Any key that is not in the table is equally likely to hash to any of the m address. The average cost to determine that the key is not in the list E[h(k)] is the cost to search to the end of the list, which is n/m. So, the total cost is ?(1+ n/m). Closed Address: Analysis(cont.) For successful search: (assuming that xi is the ith element inserted into the table, i=1,2,...,n) For each i, the probability of that xi is searched is 1/n. For a specific xi, the number of elements examined in a successful search is t+1, where t is the number of elements iserted into the same list as xi, after xi has been inserted. And for any j, the probability of that xj is inserted into the same list of xi is 1/m. So, the cost is: Expected number of elements in front of the searched one in the same linked list. Cost for computing hashing Closed Address: Analysis(cont.) The average cost of a successful search: Define ?=n/m as load factor, Number of elements in front of the searched one in the same linked list. Cost for computing hashing Commonly Used Probing Linear probing: Given an ordinary hash function h’, which is called