Homework: Query Optimization (w9)
For the four relations in the following table, find the best join order according to the dynamic
programming algorithm used in System-R. You should give the dynamic programming table
entries for evaluate the join orders. The cost of each join is the number of I/O accesses the
database system performs to execute the join. Assume that the database system uses two-pass
sort-merge join algorithm to perform the join operation. Each block contains 4 tuples and tuples
of all relations have the same size. We are interested only in left-deep join trees. Note that you
should use the System-R optimizer formula to compute the size of each join output( 2 points).