Reference no: EM1388893
Let a disk with average seek time of 10 ms, average rotational latency of 5 ms, and transfer time of 1 ms for a 4KB block. Cost of reading/writing a block is sum of these values (i.e. 16 ms). We are asked to sort large relation consisting of 10,000,000 blocks of 4KB each. For this, we use computer on which main memory available for buffering is 320 blocks (a bit small memory). We begin as usual by making sorted runs of 320 blocks each in phase 1. Then, we do 319-way merges. Find out number of phases needed, and estimate cost of Multi Phase Multiway Merge Sort.
For each of given relation schemas and sets of FD's:
a) R(A,B,C,D) with FD's AB C, B D, CD A, AD B.
b) R(A,B,C,D) with FD's A B, B C, C D, D A.
Write all BCNF violations. Decompose relations, as essential, into collections of relations whic hare in BCNF.