Download presentation

Presentation is loading. Please wait.

Published byEloise Goulder Modified over 2 years ago

1
1 Hash Tables Saurav Karmakar

2
2 Motivation What are the dictionary operations? What are the dictionary operations? (1) Insert (1) Insert (2) Delete (2) Delete (3) Search (most of the time, we will be focusing on search) (3) Search (most of the time, we will be focusing on search)

3
3 Objective Searching takes Θ(n) time in the worst case (when the data is unorganized). Searching takes Θ(n) time in the worst case (when the data is unorganized). Even using binary search it takes Θ(log n) time when the data are sorted. Even using binary search it takes Θ(log n) time when the data are sorted. Our Objective? Our Objective? O(1) time on average using hashing, under a reasonable assumption. O(1) time on average using hashing, under a reasonable assumption.

4
4 Definitions A hash table is a generalization of an array (direct addressing is allowed), so lets first talk about direct-address table. A hash table is a generalization of an array (direct addressing is allowed), so lets first talk about direct-address table. Universe of keys U={0,1,2,…,m-1}, no two elements have the same key. Universe of keys U={0,1,2,…,m-1}, no two elements have the same key. To represent a dynamic set, we use an array, or direct address table T[0..m-1], in which each position (slot) corresponds to the key in the universe. To represent a dynamic set, we use an array, or direct address table T[0..m-1], in which each position (slot) corresponds to the key in the universe.

5
5Definitions To represent a dynamic set, we use an array, or direct address table T[0..m-1], in which each position (slot) corresponds to a key in the universe. To represent a dynamic set, we use an array, or direct address table T[0..m-1], in which each position (slot) corresponds to a key in the universe. U (universe of keys) K (actual keys) 1 2 3 5 8 4 0 9 T 0 1 2 3 4 5 6 7 8 9 / / / / / / key satellite data 2 3 5 8

6
6 With a direct address table T[0..m-1], how do we search an element x with key k? With a direct address table T[0..m-1], how do we search an element x with key k? Direct-Address-Search(T,k): return T[k] Direct-Address-Search(T,k): return T[k] U (universe of keys) K (actual keys) 1 2 3 5 8 4 0 9 T 0 1 2 3 4 5 6 7 8 9 / / / / / / key satellite data 2 3 5 8

7
7 With a direct address table T[0..m-1], how do we search/insert/delete an element x with key k? With a direct address table T[0..m-1], how do we search/insert/delete an element x with key k? Direct-Address-Search(T,k): return T[k] Direct-Address-Search(T,k): return T[k] Direct-Address-Insert(T,x): T[key[x]] x Direct-Address-Insert(T,x): T[key[x]] x Direct-Address-Delete(T,x): T[key[x]] Nil Direct-Address-Delete(T,x): T[key[x]] Nil U (universe of keys) K (actual keys) 1 2 3 5 8 4 0 9 T 0 1 2 3 4 5 6 7 8 9 / / / / / / key satellite data 2 3 5 8

8
8 With a direct address table T[0..m-1], how do we search/insert/delete an element x with key k? With a direct address table T[0..m-1], how do we search/insert/delete an element x with key k? Direct-Address-Search(T,k): return T[k] Direct-Address-Search(T,k): return T[k] Direct-Address-Insert(T,x): T[key[x]] x O(1) time! Direct-Address-Insert(T,x): T[key[x]] x O(1) time! Direct-Address-Delete(T,x): T[key[x]] Nil Direct-Address-Delete(T,x): T[key[x]] Nil U (universe of keys) K (actual keys) 1 2 3 5 8 4 0 9 T 0 1 2 3 4 5 6 7 8 9 / / / / / / key satellite data 2 3 5 8

9
9 With a direct address table T[0..m-1], how do we search/insert/delete an element x with key k? With a direct address table T[0..m-1], how do we search/insert/delete an element x with key k? Direct-Address-Search(T,k): return T[k] Direct-Address-Search(T,k): return T[k] Direct-Address-Insert(T,x): T[key[x]] x Problem? Direct-Address-Insert(T,x): T[key[x]] x Problem? Direct-Address-Delete(T,x): T[key[x]] Nil Direct-Address-Delete(T,x): T[key[x]] Nil U (universe of keys) K (actual keys) 1 2 3 5 8 4 0 9 T 0 1 2 3 4 5 6 7 8 9 / / / / / / key satellite data 2 3 5 8

10
10 With direct addressing, an element with key k is inserted in slot h(k). h is called a hash function. With direct addressing, an element with key k is inserted in slot h(k). h is called a hash function. h maps the universe U of keys into the slots of a hash table T[0..m-1]. h maps the universe U of keys into the slots of a hash table T[0..m-1]. h : U {0,1,…,m-1} h : U {0,1,…,m-1} U (universe of keys) K (actual keys) 1 4 0 9 T 0 1 2 3 4 5 6 7 8 9 / / / / / / Hash Table 2 2 5 5 3 3 8 8

11
11 Basic Idea Use hash function to map keys into positions in a hash table Use hash function to map keys into positions in a hash tableIdeally If element e has key k and h is hash function, then e is stored in position h(k) of table If element e has key k and h is hash function, then e is stored in position h(k) of table To search for e, compute h(k) to locate position. If no element, dictionary does not contain e. To search for e, compute h(k) to locate position. If no element, dictionary does not contain e.

12
12 With direct addressing, an element with key k is inserted in slot h(k). h is called a hash function. With direct addressing, an element with key k is inserted in slot h(k). h is called a hash function. h maps the universe U of keys into the slots of a hash table T[0..m-1]. h maps the universe U of keys into the slots of a hash table T[0..m-1]. h : U {0,1,…,m-1} h : U {0,1,…,m-1} U (universe of keys) K (actual keys) 1 4 0 9 T 0 1 2 3 4 5 6 7 8 9 / / / / / Hash Table: Collision Problem 2 2 5 5 3 3 8 8 / / X Collision! If h(5)=h(8)

13
13 Two keys hash to the same slot --- collision. Two keys hash to the same slot --- collision. While collision is hard to avoid, if we design the hash function carefully we can at least decrease the chance for collision (and in some cases may avoid collision). While collision is hard to avoid, if we design the hash function carefully we can at least decrease the chance for collision (and in some cases may avoid collision). U (universe of keys) K (actual keys) 1 4 0 9 T 0 1 2 3 4 5 6 7 8 9 / / / / / Collision 2 2 5 5 3 3 8 8 / / X Collision! If h(5)=h(8)

14
14 Two keys hash to the same slot --- collision. Two keys hash to the same slot --- collision. While collision is hard to avoid, if we design the hash function carefully we can at least decrease the chance for collision (and in some cases may avoid collision). While collision is hard to avoid, if we design the hash function carefully we can at least decrease the chance for collision (and in some cases may avoid collision). U (universe of keys) K (actual keys) 1 4 0 9 T 0 1 2 3 4 5 6 7 8 9 / / / / / Collision Resolution by Chaining 2 2 5 3 3 8 / / If h(5)=h(8) 58

15
15 Chained-Hash-Insert(T,x): insert x at the head of list T[h(key[x])] Chained-Hash-Search(T,k): search for an element with key k in list T[h(k)] U (universe of keys) K (actual keys) 1 4 0 9 T 0 1 2 3 4 5 6 7 8 9 / / / / / Collision Resolution by Chaining 2 2 5 3 3 8 / / If h(5)=h(8) 58

16
16 Chained-Hash-Insert(T,x): insert x at the head of list T[h(key[x])] Chained-Hash-Search(T,k): search for an element with key k in list T[h(k)] Chained-Hash-Delete(T,x): delete x from the list T[h(key[x])] Time? Time? U (universe of keys) K (actual keys) 1 4 0 9 T 0 1 2 3 4 5 6 7 8 9 / / / / / Collision Resolution by Chaining 2 2 5 3 3 8 / / If h(5)=h(8) 58

17
17 Example: Let h(k)= k mod 11, insert 5,28,19,15,20,33,12,17,39,11 into T[0..10]. Example: Let h(k)= k mod 11, insert 5,28,19,15,20,33,12,17,39,11 into T[0..10]. Collision Resolution by Chaining T 0 1 2 3 4 5 6 7 8 9 / / 5 19 10 28 15 20 33 12 1739 / / 11

18
18 A hash function which causes no collision is called perfect hash function. A hash function which causes no collision is called perfect hash function. A good hash function is one which satisfies simple uniform hashing --- each key is equally likely to hash to any of the m slots. (It is difficult to check this condition though.) A good hash function is one which satisfies simple uniform hashing --- each key is equally likely to hash to any of the m slots. (It is difficult to check this condition though.) Now lets see some example for hash functions. Assume that all the keys can be represented as natural numbers. Now lets see some example for hash functions. Assume that all the keys can be represented as natural numbers. Hash function

19
19 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = floor [m(kA mod 1)], Multiplication: h(k) = floor [m(kA mod 1)], A=(5 – 1)/2=0.61803... A=(5 – 1)/2=0.61803... Two step process Step 1: Step 1: –Multiply the key k by a constant 0< A < 1 and extract the fraction part of kA. Step 2: Step 2: –Multiply kA by m and take the floor of the result. Famous Examples of Hash Functions

20
20 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803… A=(5 – 1)/2=0.61803… Example. K = 123456, m=10000. Example. K = 123456, m=10000. h(k) = 10000(123456 x 0.61803… mod 1) h(k) = 10000(123456 x 0.61803… mod 1) Famous Examples of Hash Functions

21
21 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803... A=(5 – 1)/2=0.61803... Example. K = 123456, m=10000. Example. K = 123456, m=10000. h(k) = 10000(123456 x 0.61803… mod 1) h(k) = 10000(123456 x 0.61803… mod 1) = 10000(76300.0041151… mod 1) = 10000(76300.0041151… mod 1) Famous Examples of Hash Functions

22
22 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803… A=(5 – 1)/2=0.61803… Example. K = 123456, m=10000. Example. K = 123456, m=10000. h(k) = 10000(123456 x 0.61803… mod 1) h(k) = 10000(123456 x 0.61803… mod 1) = 10000(76300.0041151… mod 1) = 10000(76300.0041151… mod 1) = 10000 x 0.0041151…) = 10000 x 0.0041151…) Famous Examples of Hash Functions

23
23 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803. A=(5 – 1)/2=0.61803. Example. K = 123456, m=10000. Example. K = 123456, m=10000. h(k) = 10000(123456 x 0.61803 mod 1) h(k) = 10000(123456 x 0.61803 mod 1) = 10000(76300.0041151… mod 1) = 10000(76300.0041151… mod 1) = 10000 x 0.0041151…) = 10000 x 0.0041151…) = 41.151… = 41.151… Famous Examples of Hash Functions

24
24 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803. A=(5 – 1)/2=0.61803. Example. K = 123456, m=10000. Example. K = 123456, m=10000. h(k) = 10000(123456 x 0.61803 mod 1) h(k) = 10000(123456 x 0.61803 mod 1) = 10000(76300.0041151… mod 1) = 10000(76300.0041151… mod 1) = 10000 x 0.0041151…) = 10000 x 0.0041151…) = 41.151… = 41.151… = 41 = 41 Famous Examples of Hash Functions

25
25 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803. A=(5 – 1)/2=0.61803. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Example 1. Shift folding: 123-456-789 (SSN) Example 1. Shift folding: 123-456-789 (SSN) 123+456+789 = 1368 123+456+789 = 1368 1368 mod 1000 = 368. 1368 mod 1000 = 368. Famous Examples of Hash Functions

26
26 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803. A=(5 – 1)/2=0.61803. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Example 1. Shift folding: 123-456-789 (SSN) Example 1. Shift folding: 123-456-789 (SSN) 123+456+789 = 1368 123+456+789 = 1368 1368 mod 1000 = 368. 1368 mod 1000 = 368. Example 2. Boundary folding: 123-456-789 (SSN) Example 2. Boundary folding: 123-456-789 (SSN) 123+654+789 = 1566 123+654+789 = 1566 1566 mod 1000 = 566. 1566 mod 1000 = 566. Famous Examples of Hash Functions

27
27 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803. A=(5 – 1)/2=0.61803. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Mid-square function: key is squared and the middle part of the result is taken as the address. Mid-square function: key is squared and the middle part of the result is taken as the address. Example. k=3121, 3121 2 = 9740641, so h(k) = Example. k=3121, 3121 2 = 9740641, so h(k) = Famous Examples of Hash Functions

28
28 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803. A=(5 – 1)/2=0.61803. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Mid-square function: key is squared and the middle part of the result is taken as the address. Mid-square function: key is squared and the middle part of the result is taken as the address. Example. k=3121, 3121 2 = 9740641, so h(k) = 406. Example. k=3121, 3121 2 = 9740641, so h(k) = 406. You can also encode the square into binary representation and take the middle part. You can also encode the square into binary representation and take the middle part. Famous Examples of Hash Functions

29
29 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803. A=(5 – 1)/2=0.61803. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Mid-square function: key is squared and the middle part of the result is taken as the address. Mid-square function: key is squared and the middle part of the result is taken as the address. Extraction: Only a part of the key is used to compute the address. Extraction: Only a part of the key is used to compute the address. Example: 123456789, first 4 digits 1234, last 4 digits 6789 Example: 123456789, first 4 digits 1234, last 4 digits 6789 first 2 digits of 1234 last 2 digits of 6789 first 2 digits of 1234 last 2 digits of 6789 we have 1289 we have 1289 Famous Examples of Hash Functions

30
30 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803. A=(5 – 1)/2=0.61803. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Mid-square function: key is squared and the middle part of the result is taken as the address. Mid-square function: key is squared and the middle part of the result is taken as the address. Extraction: Only a part of the key is used to compute the address. Extraction: Only a part of the key is used to compute the address. Radix Transformation: k is transformed into another number base Radix Transformation: k is transformed into another number base Example: 345 10 = 423 9, then 423 mod 100 = 23. Example: 345 10 = 423 9, then 423 mod 100 = 23. Famous Examples of Hash Functions

31
31 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803. A=(5 – 1)/2=0.61803. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Mid-square function: key is squared and the middle part of the result is taken as the address. Mid-square function: key is squared and the middle part of the result is taken as the address. Extraction: Only a part of the key is used to compute the address. Extraction: Only a part of the key is used to compute the address. Radix Transformation: k is transformed into another number base Radix Transformation: k is transformed into another number base Example: 345 10 = 423 9, then 423 mod 100 = 23. Example: 345 10 = 423 9, then 423 mod 100 = 23. 264 10 = 323 9, then 323 mod 100 =23. 264 10 = 323 9, then 323 mod 100 =23. Famous Examples of Hash Functions

32
32 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803. A=(5 – 1)/2=0.61803. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Mid-square function: key is squared and the middle part of the result is taken as the address. Mid-square function: key is squared and the middle part of the result is taken as the address. Extraction: Only a part of the key is used to compute the address. Extraction: Only a part of the key is used to compute the address. Radix Transformation: k is transformed into another number base Radix Transformation: k is transformed into another number base Example: 345 10 = 423 9, then 423 mod 100 = 23. Example: 345 10 = 423 9, then 423 mod 100 = 23. 264 10 = 323 9, then 323 mod 100 =23. 264 10 = 323 9, then 323 mod 100 =23. Collision is hard to avoid in the worst case! Collision is hard to avoid in the worst case! Famous Examples of Hash Functions

33
33 Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Division: h(k) = k mod m, m should be a prime number, better close to a power of 2. Multiplication: h(k) = m(kA mod 1), Multiplication: h(k) = m(kA mod 1), A=(5 – 1)/2=0.61803. A=(5 – 1)/2=0.61803. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Folding: The key is divided into several parts. These parts are combined or folded together and are transformed in a certain way to create the target address. Mid-square function: key is squared and the middle part of the result is taken as the address. Mid-square function: key is squared and the middle part of the result is taken as the address. Extraction: Only a part of the key is used to compute the address. Extraction: Only a part of the key is used to compute the address. Radix Transformation: k is transformed into another number base Radix Transformation: k is transformed into another number base Famous Examples of Hash Functions

34
34 In some applications, it is hard to dynamically allocate additional space for handling the chaining. In some applications, it is hard to dynamically allocate additional space for handling the chaining. So it is natural to come up with a different way to handle collision in which all elements are stored in the hash table itself. Then, instead of following pointers, we simply compute the sequences of slots to be examined. So it is natural to come up with a different way to handle collision in which all elements are stored in the hash table itself. Then, instead of following pointers, we simply compute the sequences of slots to be examined. Lets use insertion as an example. Lets use insertion as an example. Open Addressing

35
35 Lets use insertion as an example. Lets use insertion as an example. To perform insertion using open addressing, we successively examine or probe the hash table until we find an empty slot to put the element. Moreover, the sequence of positions probed depends on the key being inserted; i.e., Moreover, the sequence of positions probed depends on the key being inserted; i.e., h: U x {0,1,…,m-1} {0,1,…,m-1} h: U x {0,1,…,m-1} {0,1,…,m-1} Open Addressing

36
36 To perform insertion using open addressing, we successively examine or probe the hash table until we find an empty slot to put the element. To perform insertion using open addressing, we successively examine or probe the hash table until we find an empty slot to put the element. Moreover, the sequence of positions probed depends on the key being inserted; i.e., Moreover, the sequence of positions probed depends on the key being inserted; i.e., h: U x {0,1,…,m-1} {0,1,…,m-1} h: U x {0,1,…,m-1} {0,1,…,m-1} Apparently, for every key k, the probe sequence Apparently, for every key k, the probe sequence is a permutation of is a permutation of so that every position in the hash table is eventually considered as a slot for a new key as the table fills up. so that every position in the hash table is eventually considered as a slot for a new key as the table fills up. Now, for simplicity, assume k=x, and there is no deletion. Now, for simplicity, assume k=x, and there is no deletion. Open Addressing

37
37 Hash-Insert(T,k) 1. i 0 2. repeat j h(k,i) 3.if T[j] == Nil 4. then T[j] k 5. return j 6. else i i + 1 7. until i=m 8. error hash table overflow Open Addressing

38
38 Hash-Insert(T,k) 1. i 0 2. repeat j h(k,i) 3.if T[j] == Nil 4. then T[j] k 5. return j 6. else i i + 1 7. until i=m 8. error hash table overflow Open Addressing T 0 1 2 3 4 5 6 7 8 9 10 Example. Insert keys 10,22,31,4,15,28,17,88,59 into T. h(k,i)=[h(k)+i] mod m, h(k)=k mod m.

39
39 Hash-Insert(T,k) 1. i 0 2. repeat j h(k,i) 3.if T[j] == Nil 4. then T[j] k 5. return j 6. else i i + 1 7. until i=m 8. error hash table overflow Open Addressing T 0 1 2 3 4 5 6 7 8 9 10 Example. Insert keys 10,22,31,4,15,28,17,88,59 into T. h(k,i)=[h(k)+i] mod m, h(k)=k mod m. h(10,0)=(10+0) mod 11 = 10 10

40
40 Hash-Insert(T,k) 1. i 0 2. repeat j h(k,i) 3.if T[j] == Nil 4. then T[j] k 5. return j 6. else i i + 1 7. until i=m 8. error hash table overflow Open Addressing T 0 1 2 3 4 5 6 7 8 9 10 Example. Insert keys 10,22,31,4,15,28,17,88,59 into T. h(k,i)=[h(k)+i] mod m, h(k)=k mod m. h(10,0)=(10+0) mod 11 = 10 h(22,0)= 0 h(31,0)=9 h(4,0)=4 h(15,0)=(4+0) mod 11 =4 10 4 31 22

41
41 Hash-Insert(T,k) 1. i 0 2. repeat j h(k,i) 3.if T[j] == Nil 4. then T[j] k 5. return j 6. else i i + 1 7. until i=m 8. error hash table overflow Open Addressing T 0 1 2 3 4 5 6 7 8 9 10 Example. Insert keys 10,22,31,4,15,28,17,88,59 into T. h(k,i)=[h(k)+i] mod m, h(k)=k mod m. h(10,0)=(10+0) mod 11 = 10 h(22,0)= 0 h(31,0)=9 h(4,0)=4 h(15,0)=(4+0) mod 11 =4 h(15,1)=(4+1) mod 11 =5 10 31 22 4 15

42
42 Hash-Insert(T,k) 1. i 0 2. repeat j h(k,i) 3.if T[j] == Nil 4. then T[j] k 5. return j 6. else i i + 1 7. until i=m 8. error hash table overflow Open Addressing T 0 1 2 3 4 5 6 7 8 9 10 Example. Insert keys 10,22,31,4,15,28,17,88,59 into T. h(k,i)=[h(k)+i] mod m, h(k)=k mod m. 10 31 22 4 15 88 28 17 59

43
43 Hash-Search(T,k) 1. i 0 2. repeat j h(k,i) 3.if T[j] == k 4. then return j 5.i i + 1 6. until T[j]=Nil or i=m 7. return Nil Open Addressing T 0 1 2 3 4 5 6 7 8 9 10 Example. Search 15 in T. h(k,i)=[h(k)+i] mod m, h(k)=k mod m. 10 31 22 4 15 88 28 17 59 i = 0 j h(15,0)=4 T[j] != 15 i = 1 j h(15,1)=5 T[j] = 15 return 5

44
44 How about deletion? You can simply use Hash-Search to find the key first. Then what? 1. i 0 2. repeat j h(k,i) 3.if T[j] != Nil and T[j]==k 4. then T[j] Nil? exit 5.i i + 1 6. until T[j]=Nil or i=m Open Addressing T 0 1 2 3 4 5 6 7 8 9 10 Example. Delete 4,15 in T. h(k,i)=[h(k)+i] mod m, h(k)=k mod m. 10 31 22 4 15 88 28 17 59

45
45 How about deletion? You can simply use Hash-Search to find the key first. Then what? 1. i 0 2. repeat j h(k,i) 3.if T[j] != Nil and T[j] == k 4. then T[j] Nil?, exit 5.i i + 1 6. until T[j]=Nil or i=m Open Addressing T 0 1 2 3 4 5 6 7 8 9 10 Example. Delete 4,15 in T. h(k,i)=[h(k)+i] mod m, h(k)=k mod m. 10 31 22 Nil 15 88 28 17 59 Delete 15: i = 0 j h(15,0)=4 T[j] = Nil exit

46
46 How about deletion? You can simply use Hash-Search to find the key first. 1. i 0 2. repeat j h(k,i) 3.if T[j] != Nil and T[j] == k 4. then T[j] deleted, exit 5.i i + 1 6. until T[j]=Nil or i=m Open Addressing T 0 1 2 3 4 5 6 7 8 9 10 Example. Delete 4,15 in T. h(k,i)=[h(k)+i] mod m, h(k)=k mod m. 10 31 22 deleted 15 88 28 17 59 Delete 15: i = 0 j h(15,0)=4 T[j] = deleted i = 1 j h(15,1)=5 T[j]=15

47
47 How about deletion? You can simply use Hash-Search to find the key first. 1. i 0 2. repeat j h(k,i) 3.if T[j] != Nil and T[j] == k 4. then T[j] deleted, exit 5.i i + 1 6. until T[j]=Nil or i=m Open Addressing T 0 1 2 3 4 5 6 7 8 9 10 Example. Delete 4,15 in T. h(k,i)=[h(k)+i] mod m, h(k)=k mod m. 10 31 22 88 28 17 59 Delete 15: i = 0 j h(15,0)=4 T[j] = deleted i = 1 j h(15,1)=5 T[j]=15 15 is deleted! deleted

48
48 That is what we have just seen. h is an ordinary hash function; i.e., h: U {0,1,2,…,m-1} h(k,i) = [h(k) + i] mod m. Initial slot probed is exactly T[h(k)]. Linear probing

49
49 h is an ordinary hash function; i.e., h: U {0,1,2,…,m-1} h(k,i) = [h(k) + C 1 i + C 2 i 2 ] mod m, C 1, C 2 are two non-zero constants. Initial slot probed is also T[h(k)], but when i>0 it is intuitively better than linear probing. Quadratic probing

50
50 Example. Insert keys 10,22,31,4,15,28,17,88, 59 into T. h(k,i)=[h(k)+C 1 i + C 2 i 2 ] mod m, h(k)=k mod m, C 1 =1, C 2 =3. Quadratic probing T 0 1 2 3 4 5 6 7 8 9 10

51
51 Example. Insert keys 10,22,31,4,15,28,17,88,5 9 into T. h(k,i)=[h(k)+C 1 i + C 2 i 2 ] mod m, h(k)=k mod m, C 1 =1, C 2 =3. Quadratic probing T 0 1 2 3 4 5 6 7 8 9 10 31 22 4 h(10,0)=10 h(22,0)=0 h(31,0)=9 h(4,0)=4 h(15,0)=4

52
52 Example. Insert keys 10,22,31,4,15,28,17,88,5 9 into T. h(k,i)=[h(k)+C 1 i + C 2 i 2 ] mod m, h(k)=k mod m, C 1 =1, C 2 =3. Quadratic probing T 0 1 2 3 4 5 6 7 8 9 10 31 22 4 15 28 h(10,0)=10 h(22,0)=0 h(31,0)=9 h(4,0)=4 h(15,0)=4 h(15,1)=[4+1+3] mod 11 = 8 h(28,0)=6

53
53 Example. Insert keys 10,22,31,4,15,28,17,88,5 9 into T. h(k,i)=[h(k)+C 1 i + C 2 i 2 ] mod m, h(k)=k mod m, C 1 =1, C 2 =3. Quadratic probing T 0 1 2 3 4 5 6 7 8 9 10 31 22 h(17,0)=6 h(17,1)=10 h(17,2)=[6+2+3x2 2 ] mod 11 = 9 h(17,3)=[6+3+3x3 2 ] mod 11 = 3 15 28 4 17

54
54 Example. Insert keys 10,22,31,4,15,28,17,88,5 9 into T. h(k,i)=[h(k)+C 1 i + C 2 i 2 ] mod m, h(k)=k mod m, C 1 =1, C 2 =3. Quadratic probing T 0 1 2 3 4 5 6 7 8 9 10 31 22 15 4 17 88 28 59

55
55 Double probing h(k,i) = [h 1 (k) + ih 2 (k)] mod m, h 1, h 2 are two auxiliary hash functions. Initial slot probed is also T[h 1 (k)].

56
56 Example. Insert keys 10,22,31,4,15,28,17,88,5 9 into T. h(k,i)=[h 1 (k)+ih 2 (k)] mod m, h 1 (k)=k mod m, h 2 (k)=1 + [k mod (m-1)]. Double probing T 0 1 2 3 4 5 6 7 8 9 10

57
57 Example. Insert keys 10,22,31,4,15,28,17,88,5 9 into T. h(k,i)=[h 1 (k)+ih 2 (k)] mod m, h 1 (k)=k mod m, h 2 (k)=1 + [k mod (m-1)]. Double probing T 0 1 2 3 4 5 6 7 8 9 10 31 22 4 h(10,0)=10 h(22,0)=0 h(31,0)=9 h(4,0)=4 h(15,0)=4 h(15,1)=[4+1x6] mod 11 = 10 h(15,2)=[4+2x6] mod 11 = 5

58
58 Example. Insert keys 10,22,31,4,15,28,17,88,5 9 into T. h(k,i)=[h 1 (k)+ih 2 (k)] mod m, h 1 (k)=k mod m, h 2 (k)=1 + [k mod (m-1)]. Double probing T 0 1 2 3 4 5 6 7 8 9 10 31 22 h(28,0)=6 h(17,0)=6 h(17,1)=[6+1x8] mod 11 = 3 … h(88,2)=[0+2x9] mod 11 = 7 … h(59,2)=[4+2x10] mod 11 = 2 4 15 28 17

59
59 Example. Insert keys 10,22,31,4,15,28,17,88,5 9 into T. h(k,i)=[h 1 (k)+ih 2 (k)] mod m, h 1 (k)=k mod m, h 2 (k)=1 + [k mod (m-1)]. Double probing T 0 1 2 3 4 5 6 7 8 9 10 31 h(28,0)=6 h(17,0)=6 h(17,1)=[6+1x8] mod 11 = 3 … h(88,2)=[0+2x9] mod 11 = 7 … h(59,2)=[4+2x10] mod 11 = 2 4 15 28 17 22 59 88

60
60 Analysis of hashing (in general tough) In a hash table with size m, we want to store n elements with collision resolved by chaining. In a hash table with size m, we want to store n elements with collision resolved by chaining. Load Factor α = n/m. Load Factor α = n/m. Theorem: An unsuccessful search takes expected time O(1+α), under the assumption of simple uniform hashing. Theorem: An unsuccessful search takes expected time O(1+α), under the assumption of simple uniform hashing.

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google