Hashing.ppt-METUOCW.pptVIP

CENG 213 Data Structures * Clustering Problem As long as table is big enough, a free cell can always be found, but the time to do so can get quite large. Worse, even if the table is relatively empty, blocks of occupied cells start forming. This effect is known as primary clustering. Any key that hashes into the cluster will require several attempts to resolve the collision, and then it will add to the cluster. CENG 213 Data Structures * Analysis of insertion The average number of cells that are examined in an insertion using linear probing is roughly (1 + 1/(1 – λ)2) / 2 Proof is beyond the scope of text book. For a half full table we obtain 2.5 as the average number of cells examined during an insertion. Primary clustering is a problem at high load factors. For half empty tables the effect is not disastrous. CENG 213 Data Structures * Analysis of Find An unsuccessful search costs the same as insertion. The cost of a successful search of X is equal to the cost of inserting X at the time X was inserted. For λ = 0.5 the average cost of insertion is 2.5. The average cost of finding the newly inserted item will be 2.5 no matter how many insertions follow. Thus the average cost of a successful search is an average of the insertion costs over all smaller load factors. CENG 213 Data Structures * Average cost of find The average number of cells that are examined in an unsuccessful search using linear probing is roughly (1 + 1/(1 – λ)2) / 2. The average number of cells that are examined in a successful search is approximately (1 + 1/(1 – λ)) / 2. Derived from: CENG 213 Data Structures * Linear Probing – Analysis -- Example What is the average number of probes for a successful search and an unsuccessful search for this hash table? Hash Function: h(x) = x mod 11 Successful Search: 20: 9 -- 30: 8 -- 2 : 2 -- 13: 2, 3 -- 25: 3,4 24: 2,3,4,5 -- 10: 10 -- 9: 9,10, 0 Avg. Probe for SS = (1+1+1+2+2+4+1+3)/8=15/8 Unsuccessful Search: We assume that the hash fun