Research of Materialized View Selection Based on AO View Graph
Lai Ming-zhu
Abstract
Lai Ming-zhu
Abstract
Materialized view selection is an important problem researched in a data warehouse,which influences the efficiency and maintenance cost of data warehouse.In this paper,we give the cost model of materialized view selection in the AND-OR View Graph.We present materialized view selection algorithm and strategy using the genetic algorithm aswell.The experimental studies indicate that the genetic algorithm has better solutions and high efficiency.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Materialized view selection is an important problem researched in a data warehouse,which influences the efficiency and maintenance cost of data warehouse.In this paper,we give the cost model of materialized view selection in the AND-OR View Graph.We present materialized view selection algorithm and strategy using the genetic algorithm aswell.The experimental studies indicate that the genetic algorithm has better solutions and high efficiency.
Key concepts: Materialized view, Computer science, Selection (genetic algorithm), Data warehouse, Graph, Genetic algorithm, Warehouse, Data mining