Research on Materialized Views under Disk-Space Constraint in Data Warehouse

Lei Ma

doi:10.4028/www.scientific.net/AMR.989-994.1955

Paper Titles

High Precision Data Processing Method Based on the Complex-Step Differentiation
p.1938

Routing Algorithm with Energy-Efficient and High Quality of Clusters in Wireless Sensor Network
p.1942

DSP Memory Allocation Strategy Based on Greedy Algorithm
p.1946

Research on an Embedded Ultra-Low-Bit-Rate Speech Coding Algorithm
p.1951

Research on Materialized Views under Disk-Space Constraint in Data Warehouse
p.1955

Review of Otsu Segmentation Algorithm
p.1959

Non-Linear Least Squares Large Misalignment Estimation in Transfer Alignment
p.1962

Singularly Perturbed Systems with Diffusion and Time Delay
p.1969

An Algorithm of DOA Estimation in Linear Canonical Transform Domain
p.1973

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 989-994Research on Materialized Views under Disk-Space...

Research on Materialized Views under Disk-Space Constraint in Data Warehouse

Abstract:

Materialized view is an important topic in data warehouse research, and also affects the query efficiency and maintenance cost. The disk-space view-selection problem is to select a set of materialized views for the purpose of minimizing the total query processing cost and the total maintenance cost. In this paper we introduce evolutionary algorithm using stochastic ranking algorithm, which can enable materialized view selection under disk-space constraint. The algorithm improve the stochastic ranking algorithm, which can find a near-optimal feasible solution. This paper use the algorithm in Police data warehouse.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 989-994)

Pages:

1955-1958

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.989-994.1955

Citation:

Cite this paper

Online since:

July 2014

Authors:

Lei Ma*

Keywords:

Data Warehouse, Evolutionary Algorithm (EA), Materialized View

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] V. Harinarayan,A. Rajaraman, and J.D. Ullman, Implementing data cubes efficiently, inProc. 1996 ACM SIGMOD Int. Conf. Management of Data, 1996, pp.205-216.

DOI: 10.1145/235968.233333

Google Scholar

[2] H. Gupta, Selection of views to materialize in a data warehouse.

Google Scholar

[3] T.P. Runarsson and X. Yao, Stochastic rankong for constrained evolutionary optimization, IEEE Trans. Evol. Comput., vol. 4, Sept. (2000).

Google Scholar

[4] Man Li, Xiaoyong Du, Shan Wang, Selection of Materialized Relations in Ontology Repository Management System, Knowledge Science, Engineering and Management Lecture Notes in Computer Science Volume 4092, 2006, 241-251.

DOI: 10.1007/11811220_21

Google Scholar

[5] C. Zhang,X. yao, and J. Yang, An Evolutionary Approach to Materialized Views Selection in a Data Warehouse Environment, IEEE Trans. Syst., Man, Cybern. C, vol. 31, Aug. (2001).

DOI: 10.1109/5326.971656

Google Scholar

[6] Li Juan Zhou, Hai Jun Geng, Ming Sheng Xu, Research on Materialized View Selection in the Data Warehouse, Applied Mechanics and Materials, 55-57, May (2011).

DOI: 10.4028/www.scientific.net/amm.55-57.361

Google Scholar

[7] Chuan Zhang, Xin Yao, Jian Yang, Evolving materialized views in data warehouse, In proceeding of: Evolutionary Computation, (1999).

DOI: 10.1109/cec.1999.782507

Google Scholar

[8] Ren Jiadong, Li Zhiguo, and Zong Junsheng, Research on Selection of Materialized Views in Data Warehouse, Journal of Computer Research and Development, 43(Suppl. ): 621-625, (2006).

Google Scholar

[9] Feng Yu, Du Xiaoyong, Wang Shan, Materialized View Selection in a Data Warehouse, Web-Age Information Management Lecture Notes in Computer Science Volume 1846, 2000, 323-328.

DOI: 10.1007/3-540-45151-x_31

Google Scholar