Share Email Print

Proceedings Paper

Selection of views to materialize using simulated annealing algorithms
Author(s): Lijuan Zhou; Chi Liu; Hongfeng Wang; Daixin Liu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A data warehouse contains lots of materialized views over the data provided by the distributed heterogeneous databases for the purpose of efficiently implementing decision-support or OLAP queries. It is important to select the right view to materialize that answer a given set of queries. The goal is the minimization of the combination of the query evaluation and view maintenance costs. In this paper, we have addressed and designed algorithms for selecting a set of views to be materialized so that the sum of processing a set of queries and maintaining the materialized views is minimized. We develop an approach using simulated annealing algorithms to solve it. First, we explore simulated annealing algorithms to optimize the selection of materialized views. Then we use experiments to demonstrate our approach. The results show that our algorithm works better. We implemented our algorithms and a performance study of the algorithms shows that the proposed algorithm gives an optimal solution.

Paper Details

Date Published: 12 March 2002
PDF: 5 pages
Proc. SPIE 4730, Data Mining and Knowledge Discovery: Theory, Tools, and Technology IV, (12 March 2002); doi: 10.1117/12.460207
Show Author Affiliations
Lijuan Zhou, Harbin Engineering Univ and Harbin Univ. of Science and Technology (China)
Chi Liu, Harbin Univ. of Science and Technology (China)
Hongfeng Wang, Harbin Engineering Univ. (China)
Daixin Liu, Harbin Engineering Univ. (China)

Published in SPIE Proceedings Vol. 4730:
Data Mining and Knowledge Discovery: Theory, Tools, and Technology IV
Belur V. Dasarathy, Editor(s)

© SPIE. Terms of Use
Back to Top