Materialized View Selection in the Data Warehouse

Li Juan Zhou; Hai Jun Geng; Ming Sheng Xu

doi:10.4028/www.scientific.net/AMM.29-32.1133

Paper Titles

A Comprehensive Evaluation Model of the Solution to the North Pacific Ocean Garbage Patch
p.1109

A New Model for Forecasting the Locations of Next Crime
p.1116

A Study on the Key Issues of Cloud Storage Technology
p.1122

Ear Recognition Based on Supervised Learning Using Gabor Filters
p.1127

Materialized View Selection in the Data Warehouse
p.1133

A Dynamic Programming Model of the Coordination between Forest and Socio-Economy
p.1139

Return Intervals Analysis of the Sunspot Time Series
p.1144

Improvement to the Expected Discounted Penalty Function for a Classical Risk Model with a Threshold Dividend Strategy
p.1150

On the Expected Discounted Penalty Function for a Risk Model with Thinning Process
p.1156

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 29-32Materialized View Selection in the Data Warehouse

Materialized View Selection in the Data Warehouse

Abstract:

A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing decision-support or OLAP queries. Materialized view selection is one of the crucial decisions in designing a data warehouse for optimal efficiency. The goal is to select an appropriate set of views that minimizes sum of the query response time and the cost of maintaining the selected views, given a limited amount of resource, e.g., materialization time, storage space, etc. In this article, we present an improved PGA algorithm to accomplish the view selection problem; the experiments show that our proposed algorithm shows it’s superior.

You might also be interested in these eBooks

Applied Mechanics And Mechanical Engineering

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 29-32)

Pages:

1133-1138

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.29-32.1133

Citation:

Cite this paper

Online since:

August 2010

Authors:

Li Juan Zhou, Hai Jun Geng, Ming Sheng Xu

Keywords:

HRU Algorithm, Materialized View Selection, Multidimensional Lattice, PGA Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] W.H. Inmon, 2002. <<Building the Data Warehouse>>, John Wiley and Sons.

Google Scholar

[2] Roussopoulos, N., Materialized Views and Data Warehouse, 4th Workshop KRDB-97, Athens, Greece, (1997).

Google Scholar

[3] Teschke, M. and Ulbrich, A. , Using Materialized Views to Speed Up Data Warehousing, Technical Report, IMMD 6, Universität Erlangen-Nümberg, (1997).

Google Scholar

[4] Harinarayan, V., Rajaraman, A. and Ullman, J. , Implementing Data Cubes Efficiently, In proceedings of ACM SIGMOD International Conference on Management of Data, (1996).

DOI: 10.1145/233269.233333

Google Scholar

[5] Nadeua T.P. n, Teorey, T.J., Achieving Scalability in OLAP Materialized View Selection", DOLAP , 02, ACM, 2002, pp.28-34.

DOI: 10.1145/583890.583895

Google Scholar

[6] T.V. Vijay Kumar. , Greedy Selection of Materialized Views, Int. J. of Computer and Communication Technology , Vol. 1, No. 1, (2009).

Google Scholar

[7] Vassilios Petridis, Spyros Kazarlis, and Anastasios Bakirtzis. , Varying Fitness Functions in GeneticAlgorithm Constrained Optimization: TheCutting Stock and Unit Commitment Problems, IEEE Transaction on Systems, man, and cybernetics-part B: cybernetics, vol. 28, no. 5, 1998. Number of dimensions Benefit value.

DOI: 10.1109/3477.718514

Google Scholar