Q$3[20$ Marks$]$

In this question, there is no need to use XLMiner.

In the view materialization method discussed in class, the constraint is given by the number of views that

can be materialized. However, different views are of different sizes and the same number of views may not

occupy the same amount of storage. In a more realistic problem setting, we are given available memory of

size X$.$ We still assume the equal probability of querying of each possible view. Please propose a solution

for this problem setting.