Answers are grounded in this paper and cite their sources.
We study the following warehouse view-selection problem: Given a data-warehouse schema, a set of parameterised aggregate queries and their frequency distribution, and a storage-limit constraint, find a set of aggregate views that, when materialised in the warehouse, would minimise the evaluation costs of the frequent queries, subject to a storage-limit constraint. Optimising the layout of stored data using view selection has a direct impact on the performance of data warehouses. We introduce an integer-programming model to obtain optimal solutions for the warehouse view-selection problem, and propose a heuristic to obtain competitive inexact solutions where our exact method is not applicable.
No takes yet. Share an insight, caveat, or question.
Talebi et al. (2009) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: