Evolving materialized views in data warehouse

Chuan Zhang; Xin Yao; Jian Yang

doi:10.1109/CEC.1999.782507

Evolving materialized views in data warehouse

Chuan Zhang, Xin Yao, Jian Yang

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

34 Citations (Scopus)

Abstract

A data warehouse contains multiple views accessed by queries. One of the most important decisions in designing a data warehouse is the selection of materialized views for the purpose of efficiently implementing decision making. The search space for the selection of materialized views is exponentially large, therefore, heuristics have been used to search a small fraction of the space to get a near optimal solution. In this paper, we explore the use of a genetic algorithm for the selection of materialized views based on multiple global processing plans for many queries. Our experimental studies indicate that the genetic algorithm delivers better solutions than some heuristics.

Original language	English
Title of host publication	Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	823-829
Number of pages	7
Volume	2
ISBN (Print)	0780355369
DOIs	https://doi.org/10.1109/CEC.1999.782507
Publication status	Published - 1999
Externally published	Yes
Event	1999 Congress on Evolutionary Computation, CEC 1999 - Washington, DC, United States Duration: 6 Jul 1999 → 9 Jul 1999

Other

Other	1999 Congress on Evolutionary Computation, CEC 1999
Country/Territory	United States
City	Washington, DC
Period	6/07/99 → 9/07/99

Access to Document

10.1109/CEC.1999.782507

Cite this

@inproceedings{9ad764601c0d4ba2b290833a956bc74d,

title = "Evolving materialized views in data warehouse",

abstract = "A data warehouse contains multiple views accessed by queries. One of the most important decisions in designing a data warehouse is the selection of materialized views for the purpose of efficiently implementing decision making. The search space for the selection of materialized views is exponentially large, therefore, heuristics have been used to search a small fraction of the space to get a near optimal solution. In this paper, we explore the use of a genetic algorithm for the selection of materialized views based on multiple global processing plans for many queries. Our experimental studies indicate that the genetic algorithm delivers better solutions than some heuristics.",

author = "Chuan Zhang and Xin Yao and Jian Yang",

year = "1999",

doi = "10.1109/CEC.1999.782507",

language = "English",

isbn = "0780355369",

volume = "2",

pages = "823--829",

booktitle = "Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "1999 Congress on Evolutionary Computation, CEC 1999 ; Conference date: 06-07-1999 Through 09-07-1999",

}

Zhang, C, Yao, X & Yang, J 1999, Evolving materialized views in data warehouse. in Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999. vol. 2, 782507, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 823-829, 1999 Congress on Evolutionary Computation, CEC 1999, Washington, DC, United States, 6/07/99. https://doi.org/10.1109/CEC.1999.782507

Evolving materialized views in data warehouse. / Zhang, Chuan; Yao, Xin; Yang, Jian.

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999. Vol. 2 Piscataway, NJ : Institute of Electrical and Electronics Engineers (IEEE), 1999. p. 823-829 782507.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Evolving materialized views in data warehouse

AU - Zhang, Chuan

AU - Yao, Xin

AU - Yang, Jian

PY - 1999

Y1 - 1999

N2 - A data warehouse contains multiple views accessed by queries. One of the most important decisions in designing a data warehouse is the selection of materialized views for the purpose of efficiently implementing decision making. The search space for the selection of materialized views is exponentially large, therefore, heuristics have been used to search a small fraction of the space to get a near optimal solution. In this paper, we explore the use of a genetic algorithm for the selection of materialized views based on multiple global processing plans for many queries. Our experimental studies indicate that the genetic algorithm delivers better solutions than some heuristics.

AB - A data warehouse contains multiple views accessed by queries. One of the most important decisions in designing a data warehouse is the selection of materialized views for the purpose of efficiently implementing decision making. The search space for the selection of materialized views is exponentially large, therefore, heuristics have been used to search a small fraction of the space to get a near optimal solution. In this paper, we explore the use of a genetic algorithm for the selection of materialized views based on multiple global processing plans for many queries. Our experimental studies indicate that the genetic algorithm delivers better solutions than some heuristics.

UR - http://www.scopus.com/inward/record.url?scp=77956255407&partnerID=8YFLogxK

U2 - 10.1109/CEC.1999.782507

DO - 10.1109/CEC.1999.782507

M3 - Conference proceeding contribution

AN - SCOPUS:77956255407

SN - 0780355369

VL - 2

SP - 823

EP - 829

BT - Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

T2 - 1999 Congress on Evolutionary Computation, CEC 1999

Y2 - 6 July 1999 through 9 July 1999

ER -

Evolving materialized views in data warehouse

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this