Slideshow:
It will help limit the search space
Schematically:
We can find a search key in the index file quickly using binary search !!!
We can find the disk blocks containing the search key quickly by using the hash function
In other words:
Search key value ======> List of blocks that contains the search key value