You may discuss problems with other students in the class. However, each student must write up his or her own solution to each problem independently. That is, while you may formulate the solutions to problems in collaboration with classmates, you must be able to articulate the solutions on your own.
1.In Database Management Systems by Ramakrishnan and Gehrke, Chapter 12, Exercise 12.4, pg. 356, Parts 1, 3, 4.
2. For this problem again use the information about
relations R and S of Problem 1 above (12.4 of Ramakrishnan and Gehrke).
However, in each of Parts A and B,
add an index as indicated and calculate the cost of joining R and S
using an index nested loop join.
A Assume an Alternative 2 hash index on
attribute b of S.
B Assume an Alternative 1, clustered
B+ tree index of order 50 on attribute a of R.
3.In Database Management Systems by Ramakrishnan and Gehrke, Chapter 14, Exercise 14.2, pgs. 404-405, Part 1: do (f), (g), and "age=20 ^ title='CFO' ".
4.Assume that you have relations R and S of Problems 1 and 2 above, with the same characteristics and BOTH indexes of Parts A and B of Problem 2. Assume that you also have a relation T with the same properties as relation R, but with no indexes built for it. Also assume that attribute a of R and attribute c of T range over 3000 values.
Execute the dynamic programming algorithm to find an optimal left-deep plan for the evaluation
of
((R JOIN S on R.a=S.b) JOIN T on S.b=T.c)
Show your work.