Research on Materialized View Selection in the Data Warehouse

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

361-366

Citation:

Online since:

May 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Inmon WH. Building the data warehouse [M]. 4th ed. [S. l. ], New York: Wiley, (2005).

Google Scholar

[2] Lin yu. Principles and Practice of Data Warehouse [M], Posts & Telecom Press, 2003: 61-64.

Google Scholar

[3] Harinarayan V, Rajaraman A, Ullman JD. Implementing data cubes efficiently[C]. In: Jagadish HV, Mumick IS. eds. Proc. of the 1996 ACM SIGMOD Int'l Cone on Management of Data(SIGMOD'96). Montreal: ACM Press. 1996: 205—216.

DOI: 10.1145/235968.233333

Google Scholar

[4] H. Gupta and I. S. Mumick, Selection of views to materialize under a maintenance cost constraint[C]. in Proc. 7th Int. Conf. Database Theory, 1999: 453–470.

DOI: 10.1007/3-540-49257-7_28

Google Scholar

[5] SRINIVAS M, PATNAIK L M. Adaptive probabilities of crossover and mutation in genetic algorithms[J]. IEEE TRANSACTIONS ON SYSTEMS, MAN AND CYBERNETICS, 1994, 24(4): 656—667.

DOI: 10.1109/21.286385

Google Scholar

[6] M. Lee and J. Hammer, Speeding up materialized view selection in data warehouses using a randomized algorithm [J]. Cooperative Information Systems, 2001, 10(3): 327–353.

DOI: 10.1142/s0218843001000370

Google Scholar

[7] Vassilios Petridis, Spyros Kazarlis, and Anastasios Bakirtzis. Varying Fitness Functions in Genetic Algorithm Constrained Optimization: The Cutting Stock and Unit Commitment Problems [J]. IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, 1998, 28(5): 629-640.

DOI: 10.1109/3477.718514

Google Scholar