Data Structures Using C++ 2E

Chapter 9
Searching and Hashing Algorithms
 Hashing
• Algorithm of order one (on average)
• Requires data to be specially organized
– Hash table
• Helps organize data
• Stored in an array
• Denoted by HT
– Hash function
• Arithmetic function denoted by h
• Applied to key X
• Compute h(X): read as h of X
• h(X) gives address of the item

Data Structures Using C++ 2E 2

 Hashing (cont’d.)
• Organizing data in the hash table
– Store data within the hash table (array)
– Store data in linked lists
• Hash table HT divided into b buckets
– HT[0], HT[1], . . ., HT[b – 1]
– Each bucket capable of holding r items
– Follows that br = m, where m is the size of HT
– Generally r = 1
• Each bucket can hold one item
• The hash function h maps key X onto an integer t
– h(X) = t, such that 0 <= h(X) <= b – 1
Data Structures Using C++ 2E 3
 Hashing (cont’d.)

• See Examples 9-2 and 9-3

• Synonym
– Occurs if h(X1) = h(X2)
• Given two keys X1 and X2, such that X1 ≠ X2
• Overflow
– Occurs if bucket t full
• Collision
– Occurs if h(X1) = h(X2)
• Given X1 and X2 nonidentical keys

Data Structures Using C++ 2E 4

 Hashing (cont’d.)
• Overflow and collision occur at same time
– If r = 1 (bucket size = one)
• Choosing a hash function
– Main objectives
• Choose an easy to compute hash function
• Minimize number of collisions
• If HTSize denotes the size of hash table (array size
holding the hash table)
– Assume bucket size = one
• Each bucket can hold one item
• Overflow and collision occur simultaneously

Data Structures Using C++ 2E 5

 Hash Functions: Some Examples
• Mid-square
• Folding
• Division (modular arithmetic)
– In C++
• h(X) = iX % HTSize;
– C++ function

Data Structures Using C++ 2E 6

 Collision Resolution

• Desirable to minimize number of collisions

– Collisions unavoidable in reality
• Hash function always maps a larger domain onto a
smaller range
• Collision resolution technique categories
– Open addressing (closed hashing)
• Data stored within the hash table
– Chaining (open hashing)
• Data organized in linked lists
• Hash table: array of pointers to the linked lists

Data Structures Using C++ 2E 7

Collision Resolution: Open Addressing

• Data stored within the hash table

– For each key X, h(X) gives index in the array
• Where item with key X likely to be stored

Data Structures Using C++ 2E 8

 Linear Probing
• Starting at location t
– Search array sequentially to find next available slot
• Assume circular array
– If lower portion of array full
• Can continue search in top portion of array using mod
operator
– Starting at t, check array locations using probe
sequence
• t, (t + 1) % HTSize, (t + 2) % HTSize, . . ., (t + j) %
HTSize

Data Structures Using C++ 2E 9

 Linear Probing (cont’d.)
• The next array slot is given by
– (h(X) + j) % HTSize where j is the jth probe
• See Example 9-4
• C++ code implementing linear programming

Data Structures Using C++ 2E 10

 Linear Probing (cont’d.)
• Causes clustering
– More and more new keys would likely be hashed to
the array slots already occupied

FIGURE 9-5 Hash table of size 20

FIGURE 9-6 Hash table of size 20 with certain positions occupied

FIGURE 9-7 Hash table of size 20 with certain positions occupied

Data Structures Using C++ 2E 11

 Linear Probing (cont’d.)
• Improving linear probing
– Skip array positions by fixed constant (c) instead of
one
– New hash address:
• If c = 2 and h(X) = 2k (h(X) even)
– Only even-numbered array positions visited
• If c = 2 and h(X) = 2k + 1, ( h(X) odd)
– Only odd-numbered array positions visited
• To visit all the array positions
– Constant c must be relatively prime to HTSize

Data Structures Using C++ 2E 12

 Random Probing

• Uses random number generator to find next

available slot
– ith slot in probe sequence: (h(X) + ri) % HTSize
• Where ri is the ith value in a random permutation of the
numbers 1 to HTSize – 1
– All insertions, searches use same random numbers
sequence
• See Example 9-5

Data Structures Using C++ 2E 13

 Rehashing

• If collision occurs with hash function h

– Use a series of hash functions: h1, h2, . . ., hs
– If collision occurs at h(X)
• Array slots hi(X), 1 <= hi(X) <= s examined

Data Structures Using C++ 2E 14

 Quadratic Probing
• Suppose
– Item with key X hashed at t (h(X) = t and 0 <= t <=
HTSize – 1)
– Position t already occupied
• Starting at position t
– Linearly search array at locations (t + 1)% HTSize, (t
+ 22 ) % HTSize = (t + 4) %HTSize, (t + 32) % HTSize
= (t + 9) % HTSize, . . ., (t + i2) % HTSize
• Probe sequence: t, (t + 1) % HTSize (t + 22 ) %
HTSize, (t + 32) % HTSize, . . ., (t + i2) % HTSize

Data Structures Using C++ 2E 15

 Quadratic Probing (cont’d.)

• See Example 9-6

• Reduces primary clustering
• Does not probe all positions in the table
– Probes about half the table before repeating probe
sequence
• When HTSize is a prime
– Considerable number of probes
• Assume full table
• Stop insertion (and search)

Data Structures Using C++ 2E 16

 Quadratic Probing (cont’d.)

• Generating the probe sequence

Data Structures Using C++ 2E 17

 Quadratic Probing (cont’d.)
• Consider probe sequence
– t, t +1, t + 22, t + 32, . . . , (t + i2) % HTSize
– C++ code computes ith probe
• (t + i2) % HTSize

Data Structures Using C++ 2E 18

 Quadratic Probing (cont’d.)

• Pseudocode implementing quadratic probing

Data Structures Using C++ 2E 19

 Quadratic Probing (cont’d.)

• Random, quadratic probings eliminate primary

clustering
• Secondary clustering
– Random, quadratic probing functions of home
positions
• Not original key

Data Structures Using C++ 2E 20

 Quadratic Probing (cont’d.)

• Secondary clustering (cont’d.)

– If two nonidentical keys (X1 and X2) hashed to same
home position (h(X1) = h(X2))
• Same probe sequence followed for both keys
– If hash function causes a cluster at a particular home
position
• Cluster remains under these probings

Data Structures Using C++ 2E 21

 Quadratic Probing (cont’d.)
• Solve secondary clustering with double hashing
– Use linear probing
• Increment value: function of key
– If collision occurs at h(X)
• Probe sequence generation

• See Examples 9-7 and 9-8

Data Structures Using C++ 2E 22

 Collision Resolution: Chaining (Open
Hashing)
• Hash table HT: array of pointers
– For each j, where 0 <= j <= HTsize -1
• HT[j] is a pointer to a linked list
• Hash table size (HTSize): less than or equal to the
number of items
FIGURE 9-10 Linked hash table

Data Structures Using C++ 2E 23

Collision Resolution: Chaining (cont’d.)

• Item insertion and collision

– For each key X (in the item)
• First find h(X) – t, where 0 <= t <= HTSize – 1
• Item with this key inserted in linked list pointed to by
HT[t]
– For nonidentical keys X1 and X2
• If h(X1) = h(X2)
– Items with keys X1 and X2 inserted in same linked list
• Collision handled quickly, effectively

Data Structures Using C++ 2E 24

Collision Resolution: Chaining (cont’d.)
• Search
– Determine whether item R with key X is in the hash
table
• First calculate h(X)
– Example: h(X) = T
• Linked list pointed to by HT[t] searched sequentially
• Deletion
– Delete item R from the hash table
• Search hash table to find where in a linked list R exists
• Adjust pointers at appropriate locations
• Deallocate memory occupied by R

Data Structures Using C++ 2E 25

Collision Resolution: Chaining (cont’d.)

• Overflow
– No longer a concern
• Data stored in linked lists
• Memory space to store data allocated dynamically
– Hash table size
• No longer needs to be greater than number of items
– Hash table less than the number of items
• Some linked lists contain more than one item
• Good hash function has average linked list length still
small (search is efficient)

Data Structures Using C++ 2E 26

Collision Resolution: Chaining (cont’d.)

• Advantages of chaining
– Item insertion and deletion: straightforward
– Efficient hash function
• Few keys hashed to same home position
• Short linked list (on average)
– Shorter search length
• If item size is large
– Saves a considerable amount of space

Data Structures Using C++ 2E 27

Collision Resolution: Chaining (cont’d.)
• Disadvantage of chaining
– Small item size wastes space
• Example: 1000 items each requires one word of
storage
– Chaining
• Requires 3000 words of storage
– Quadratic probing
• If hash table size twice number of items: 2000 words
• If table size three times number of items
– Keys reasonably spread out
– Results in fewer collisions

Data Structures Using C++ 2E 28

 Hashing Analysis

• Load factor
– Parameter α

TABLE 9-5 Number of comparisons in hashing

Data Structures Using C++ 2E 29

 Summary
• Hashing
– Data organized using a hash table; Two ways to organize data
– Apply hash function to determine if item with a key is in the table
• Hash functions: Mid-square, Folding, Division (modular
arithmetic)
• Collision resolution technique categories
– Open addressing (closed hashing)
– Chaining (open hashing)
• Search analysis
– Review number of key comparisons
– Worst case, best case, average case

Data Structures Using C++ 2E 30