Suppose you need to sort a relation of 40 gigabytes, with
4-kilobyte blocks, using a memory size of 40 megabytes. Suppose the
cost of a seek is 5 milliseconds, while the disk transfer rate is
40 megabytes per second. Assume bb = 1. What is the total time in
seconds to sort the relation?
Now, assume a flash storage device is used instead of a disk, and
it has a latency of 20 microsecond and a transfer rate of 400
megabytes per second. Recompute the cost of sorting the relation,
in seconds.
As an exercise (no marks), solve the problem with bb = 100 blocks and observe the difference in answers.
`Hey,
Note: Brother if you have any queries related the answer please do comment. I would be very happy to resolve all your queries.
Kindly revert for any queries
Thanks.
Suppose you need to sort a relation of 40 gigabytes, with 4-kilobyte blocks, using a memory...
Assume a sorted relation has 40 GB (file size), block size is 4KB, each block stores 40 records. Assume the index B+ tree has entries for each record, and the fanout of the node for B+ tree is 100. Select with an equality condition on the attribute, search key of index. Assume the disk seek cost is 5 milliseconds, and block transfer cost is 1 milliseconds. Also assume if the selection is a non key attribute, there are 100 matching...