Algorithm of Multidimensional Materialized View Selection Under Cost Constraints

Yun Yang · Jisuanji gongcheng · 2005

Materialized view selection under cost constraint is one of the most important issues in data warehouse development. This paper firstly presents a materialized view selection algorithm, which selects views to materialize based on the minimal ancestor tree and implements with an improved heuristic strategy. This algorithm can effectively solve the two kinds of problems on selecting views to materialize. Both theory and experiment results show that the algorithm is more efficient than the previous algorithm under high dimension situations.

Read the paper · More papers on PaperTik