作者: T. V. Vijay Kumar , Santosh Kumar
DOI: 10.1007/978-3-642-32129-0_26
关键词:
摘要: A data warehouse stores historical information, integrated from several large heterogeneous sources spread across the globe, for purpose of supporting decision making. The queries making are usually analytical and complex in nature their response time is high when processed against a warehouse. This query can be reduced by materializing views over Since all cannot materialized, due to space constraints, optimal selection subsets an NP-complete problem, there need selecting appropriate materialization. An approach such using Genetic Algorithm proposed this paper. computes top-T multidimensional lattice exploring exploiting search containing possible views. Further, approach, comparison greedy algorithm, able comparatively lower total cost evaluating