摘要
根据 0 - 1背包问题和方体的格模型 ,提出了数据方体中实视图的最优选择算法SemiWide(SElectionofMaterializedvIewsWIthinDatacubE) ,并证明了该算法可以给出选择问题的最优解 .实验表明 ,SemiWide的效率是较为理想的 .
This paper provides an algorithm named SemiWide (SElection of Materialized vIews WIthin Data cubE) to select the optimal set of materialized views within data cubes based on the 0-1 knapsack problem and the lattice model of data cubes. Our experiments show that the efficiency of the algorithm is quite good.
出处
《河南大学学报(自然科学版)》
CAS
2001年第1期20-24,共5页
Journal of Henan University:Natural Science