Slideshow:

Prelude to dynamic hashing: change in my illustration

Original depiction:

Prelude to dynamic hashing: change in my illustration

New way:

Prelude to dynamic hashing: change in my illustration

Example:

Furthermore, we assume that the block array table is completely stored in memory
(No disk access needed)

Review: hash index
- A hash index consists of a hash index file containing B block numbers:
- To locate the data record with search key W, we hash the search key W:
Change in the way I will dispict the hash index
- In order to extend the size of the hash buckets, I will depict (draw) the block numbers as follows:
  Example: