Optimal view selection for multidimensional database systems

This paper presents a greedy algorithm to compute the best set of views with respect to a given set of queries and their frequencies, for multidimensional databases. Previous approaches have not taken frequency of queries into consideration. We show that our proposed algorithm determines a set of views with the most benefits compared to previous approaches.