Scribd
Upload
9 views14 pages

Lec 17

DS lec17 Notes

Uploaded by

Padiyappa Koogati
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
9 views14 pages

Lec 17

DS lec17 Notes

Uploaded by

Padiyappa Koogati
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 14

Overflow Handling

• An overflow occurs when the home bucket for a


new pair (key, element) is full.
• We may handle overflows by:
 Search the hash table in some systematic fashion for
a bucket that is not full.
• Linear probing (linear open addressing).
• Quadratic probing.
• Random probing.
 Eliminate overflows by permitting each bucket to
keep a list of all pairs for which it is the home bucket.
• Array linear list.
• Chain.
Linear Probing – Get And Put
• divisor = b (number of buckets) = 17.
• Home bucket = key % 17.

0 4 8 12 16
34 0 45 6 23 7 28 12 29 11 30 33

• Put in pairs whose keys are 6, 12, 34, 29, 28, 11,
23, 7, 0, 33, 30, 45
Linear Probing – Remove
0 4 8 12 16
34 0 45 6 23 7 28 12 29 11 30 33

• remove(0)
0 4 8 12 16
34 45 6 23 7 28 12 29 11 30 33

• Search cluster for pair (if any) to fill vacated bucket.

0 4 8 12 16
34 45 6 23 7 28 12 29 11 30 33
Linear Probing – remove(34)
0 4 8 12 16
34 0 45 6 23 7 28 12 29 11 30 33
0 4 8 12 16
0 45 6 23 7 28 12 29 11 30 33

• Search cluster for pair (if any) to fill vacated


bucket.
0 4 8 12 16
0 45 6 23 7 28 12 29 11 30 33

0 4 8 12 16
0 45 6 23 7 28 12 29 11 30 33
Linear Probing – remove(29)
0 4 8 12 16
34 0 45 6 23 7 28 12 29 11 30 33
0 4 8 12 16
34 0 45 6 23 7 28 12 11 30 33

• Search cluster for pair (if any) to fill vacated


bucket.
0 4 8 12 16
34 0 45 6 23 7 28 12 11 30 33
0 4 8 12 16
34 0 45 6 23 7 28 12 11 30 33
0 4 8 12 16
34 0 6 23 7 28 12 11 30 45 33
Performance Of Linear Probing

0 4 8 12 16
34 0 45 6 23 7 28 12 29 11 30 33

• Worst-case get/put/remove time is Theta(n), where n is


the number of pairs in the table.
• This happens when all pairs are in the same cluster.
Expected Performance

0 4 8 12 16
34 0 45 6 23 7 28 12 29 11 30 33
• alpha = loading density = (number of pairs)/b.
 alpha = 12/17 .
• Sn = expected number of buckets examined in a successful search when n is large
• Un = expected number of buckets examined in a unsuccessful search when n is large
• Time to put and remove governed by Un.
Expected Performance
• Sn ~ ½(1 + 1/(1 – alpha))
• Un ~ ½(1 + 1/(1 – alpha)2)
• Note that 0 <= alpha <= 1.
alpha Sn Un

0.50 1.5 2.5


Alpha <= 0.75 is
0.75 2.5 8.5 recommended.

0.90 5.5 50.5


Hash Table Design
• Performance requirements are given, determine maximum
permissible loading density.
• We want a successful search to make no more than 10 compares
(expected).
 Sn ~ ½(1 + 1/(1 – alpha))
 alpha <= 18/19
• We want an unsuccessful search to make no more than 13
compares (expected).
 Un ~ ½(1 + 1/(1 – alpha)2)
 alpha <= 4/5
• So alpha <= min{18/19, 4/5} = 4/5.
Hash Table Design
• Dynamic resizing of table.
 Whenever loading density exceeds threshold (4/5 in our
example), rehash into a table of approximately twice the
current size.
• Fixed table size.
 Know maximum number of pairs.
 No more than 1000 pairs.
 Loading density <= 4/5 => b >= 5/4*1000 = 1250.
 Pick b (equal to divisor) to be a prime number or an odd
number with no prime divisors smaller than 20.
Linear List Of Synonyms

• Each bucket keeps a linear list of all pairs


for which it is the home bucket.
• The linear list may or may not be sorted by
key.
• The linear list may be an array linear list or
a chain.
[0] 0 34

Sorted Chains
• Put in pairs [4]
whose keys are
6 23
6, 12, 34, 29,
7
28, 11, 23, 7, 0,
33, 30, 45 [8]
• Home bucket =
key % 17. 11 28 45
[12] 12 29
30

[16] 33
Expected Performance

• Note that alpha >= 0.


• Expected chain length is alpha.
• Sn ~ 1 + alpha/2.
• Un <= alpha, when alpha < 1.
• Un ~ 1 + alpha/2, when alpha >= 1.
java.util.Hashtable

• Unsorted chains.
• Default initial b = divisor = 101
• Default alpha <= 0.75
• When loading density exceeds max permissible
density, rehash with newB = 2b+1.

You might also like