Vertical Fragmentation of Views in Relational Data Warehouses


Within the framework of the data warehouse design methodology we are developing, in this paper we investigate the problem of vertical fragmentation of relational views aimed at minimizing the global query response time. Each view includes several measures which, within the workload, are seldom requested together; thus, the system performance may be increased by partitioning the views to be materialized into smaller tables. On the other hand, drill-across queries involve measures taken from two or more views; in this case the access costs may be decreased by unifying these views into larger tables. Within the data warehouse context, the presence of redundant views makes the fragmentation problem more complex than in traditional relational databases since it requires to decide on which views each query should be executed. After formalizing the fragmentation problem as a 0-1 integer linear programming problem, we define a cost function and propose a branch-and-bound algorithm to minimize it. Finally, we demonstrate the usefulness of our approach by presenting a sample set of experimental results.

Extracted Key Phrases

6 Figures and Tables

Cite this paper

@inproceedings{Golfarelli1999VerticalFO, title={Vertical Fragmentation of Views in Relational Data Warehouses}, author={Matteo Golfarelli and Dario Maio and Stefano Rizzi}, booktitle={SEBD}, year={1999} }