This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Un1 = Summation from i = 1 to m of i times probability i probes is enough Un1 <= Summation from i =0 to infinity of the load factor of n1 to the ith power Un1 <= 1/(1  load factor of n1) Un = 1/(1  loadfactor) For load factor = .77, Un = about 5 Cost of Retrieval # probes to retrieve record R = # probes to insert R so we need the average cost of successful search in table of n entries (Sn) Sn = average # probes it took to insert each record which is average # probes in unsuccessful search when i1 records are in Sn = (Summation from i = 1 to n of Ui1) / n = (1 / n) Summation from i = 1 to n of 1 / (1  load factor of i  1) = (1 / load factor of n) * ln(1 / (1  load factor of n)) load factor  Un = 1 / (1  load factor) INSERT  Sn (from above) RETRIEVE .1  1.11  1.05 .2  1.25  1.12 .5  2  1.39 .6  2.5  1.53 .7  3.33  1.72 .8  5  2.01 .9  10  2.56 .99  100  4.65 .999  1000  6.91...
View
Full
Document
This note was uploaded on 04/28/2009 for the course CSC 316 taught by Professor Rhee during the Spring '08 term at N.C. State.
 Spring '08
 Rhee

Click to edit the document details