Question: Consider two relations R(x,y) and S(y,m) with B(R) = 1,000, B(S) = 500, and M. 101. Assume that attribute y of relation R has two

 Consider two relations R(x,y) and S(y,m) with B(R) = 1,000, B(S)

Consider two relations R(x,y) and S(y,m) with B(R) = 1,000, B(S) = 500, and M. 101. Assume that attribute y of relation R has two distinct values (y1 and y2) and the values are evenly distributed in R. Similarly, attribute y of relation S has the same two values (y1 and y2) and the values are evenly distributed in S. Suppose that initially both relations are not sorted by attribute y. Compute the total number (in average) of disk I/Os that are needed for the sort-merge join algorithm in order to compute RDA S

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!