Materialization of fragmented views in multidimensional databases

The most effective technique to enhance performances of multidimensional databases consists in materializing redundant aggregates called views. In the classical approach to materialization, each view includes all and only the measures of the cube it aggregates. In this paper we investigate the benef...

Full description

Saved in:
Bibliographic Details
Published in:Data & knowledge engineering Vol. 49; no. 3; pp. 325 - 351
Main Authors: Golfarelli, Matteo, Maniezzo, Vittorio, Rizzi, Stefano
Format: Journal Article
Language:English
Published: Elsevier B.V 01.06.2004
Subjects:
ISSN:0169-023X, 1872-6933
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The most effective technique to enhance performances of multidimensional databases consists in materializing redundant aggregates called views. In the classical approach to materialization, each view includes all and only the measures of the cube it aggregates. In this paper we investigate the benefits of materializing views in vertical fragments, aimed at minimizing the workload response time. We formalize the fragmentation problem as a 0–1 integer linear programming problem, which is then solved by means of a standard integer programming solver to determine the optimal fragmentation for a given workload. Finally, we demonstrate the usefulness of fragmentation by presenting a large set of experimental results based on the TPC-H benchmark.
ISSN:0169-023X
1872-6933
DOI:10.1016/j.datak.2003.11.001