Suppose you need to sort a relation of 40 GB with a 4KB blocks using a memory size of 40 MB. Suppose the cost of a seek is 5 milliseconds while the disk transfer rate is 40 MB per second/
a) Find the cost of sorting the relation in seconds with
bb =1 and
bb =100
b) In each case, how many merge passes are required?
c) Suppose a flash storage device is used instead of disk, and it has a seek time of 1 microsecond and a transfer rate of 40 MB per second
Recompute the cost of sorting the relation in seconds with
bb =1 and
bb =100