Optimal view selection for multidimensional database systems

Authors:
Elena Soutyrina;Farshad Fotouhi
Affiliations:
Department of Computer Science, Wayne State University, Detroit, Michigan;Department of Computer Science, Wayne State University, Detroit, Michigan
Venue:
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
Year:
1997

Citing 5
Cited 0

Fundamentals of algorithmics

Fundamentals of algorithmics
Multi-table joins through bitmapped join indices

ACM SIGMOD Record
Implementing data cubes efficiently

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Including Group-By in Query Optimization

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Aggregate-Query Processing in Data Warehousing Environments

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 benefit compare to previous approaches.