Assignment 6

Overview

 Topic: Join Algorithms
Related Reading: Ch. 14.1-14.4
Due: 12:45pm Thursday, 20 November 2003
For this assignment, you may either work alone or with one other person. If you do work as a pair, you should make sure that both names are at the top of your submission.

For assistance, you may recall that solutions for all odd-numbered exercises are available through the textbook website.

Please look at, but do not answer, questions from Exercise 14.4. Instead, you are to answer those questions based on the following information about R and S.
Relation R contains 200,000 tuples and has 20 tuples per page.
Relation S contains 4,000,000 tuples and has 20 tuples per page.
Attribute a of relation R is the primary key for R.
Each tuple of R joins with exactly 20 tuples of S.
1,002 buffer pages are available.

Please give explanations for all of your calculations. Also, if you feel that some question is no longer applicable in this scenario, please explain why.