Research on Materialized View Selection in the Data Warehouse

被引：0

作者：

Zhou Li-juan ^{[1
]}

Geng Hai-jun ^{[1
]}

Xu Ming-sheng ^{[1
]}

机构：

[1] Capital Normal Univ, Informat Engn Coll, Beijing 100037, Peoples R China

来源：

RECENT TRENDS IN MATERIALS AND MECHANICAL ENGINEERING MATERIALS, MECHATRONICS AND AUTOMATION, PTS 1-3 | 2011年 / 55-57卷

关键词：

Data warehouse; Materialized view selection; Genetic algorithm;

D O I：

10.4028/www.scientific.net/AMM.55-57.361

中图分类号：

TH [机械、仪表工业];

学科分类号：

0802 ;

摘要：

Materialized view is an effective method for improving the efficiency of queries in data warehouse system, and the problem of materialized view selection is one of the most important decisions. In this paper, an algorithm was proposed to select a set of materialized views under maintenance cost constraints for the purpose of minimizing the total query processing cost; the algorithm adopts the dynamic penalty function to solve the resource constraints view selection. The experimental study shows that the algorithm has better solutions and high efficiency.

引用

页码：361 / 366

页数：6

共 7 条

[1] Gupta H, 1999, LECT NOTES COMPUT SC, V1540, P453
[2] Harinarayan V., 1996, SIGMOD Record, V25, P205, DOI 10.1145/235968.233333
[3] Inmon W. H., 2005, ''Building Data Warehouse
[4] Speeding up materialized view selection in data warehouses using a randomized algorithm
Lee, MS
Hammer, J
[J]. INTERNATIONAL JOURNAL OF COOPERATIVE INFORMATION SYSTEMS, 2001, 10 (03) : 327 - 353
[5] Lin yu, 2003, PRINCIPLES PRACTICE, P61
[6] Varying fitness functions in genetic algorithm constrained optimization: The cutting stock and unit commitment problems
Petridis, V
Kazarlis, S
Bakirtzis, A
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1998, 28 (05): : 629 - 640
[7] ADAPTIVE PROBABILITIES OF CROSSOVER AND MUTATION IN GENETIC ALGORITHMS
SRINIVAS, M
PATNAIK, LM
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1994, 24 (04): : 656 - 667

← 1 →