Question $19$

$4$ pts

Consider the following view materialization problem using the HRU algorithm. Assume the top view $\{N,O,P\}$ has already been materialized before this algorithm setup.

We want you to compute the next two choices $)=(2,$ that is$,$ the best choice for the $1$ st iteration and the best choice for the second iteration, just like in class. Note that you'll have to determine the $1$st choice before you can find the $2$nd choice.

Fill the table with your HRU calculations for all the views. The grading scheme is based on ALL the calculations, not just on your best two choices.

$\backslash$table$[[$View$,1$st round,$2$nd round$],[\{N,O\},,],[\{N,P\},,],[\{O,P\},,]]$

$\backslash$table$[[\{N,O\},,,],[\{N,P\},,,],[\{O,P\},,,],[\{N\},,,],[\{O\},,,],[\{P\},,,],[\{\},,,]]$

$\backslash$table$[[,$After the $1$st round,After the $2$nd round$],[$The Best View to Materialize,,$]]$