Abstract
A data warehouse stores historical information, integrated from several large heterogeneous data sources spread across the globe, for the purpose of supporting decision making. The queries for decision making are usually analytical and complex in nature and their response time is high when processed against a large data warehouse. This query response time can be reduced by materializing views over a data warehouse. Since all views cannot be materialized, due to space constraints, and optimal selection of subsets of views is an NP-complete problem, there is a need for selecting appropriate subsets of views for materialization. An approach for selecting such subsets of views using Genetic Algorithm is proposed in this paper. This approach computes the top-T views from a multidimensional lattice by exploring and exploiting the search space containing all possible views. Further, this approach, in comparison to the greedy algorithm, is able to comparatively lower the total cost of evaluating all the views.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baralis, E., Paraboschi, S., Teniente, E.: Materialized view selection in a multidimensional database. In: Proceeding of 23rd VLDB Conference, Greece, pp. 156–165 (1997)
Chirkova, R., Halevy, A.Y., Suciu, D.: A formal perspective on the view selection problem. In: 27 VLDB Conference, Italy (2001)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley (1989)
Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in Genetic Algorithms. In: Foundations of Genetic Algorithms, MK, pp. 69–93 (1991)
Gupta, H., Mumick, I.: Selection of Views to Materialize in a Data Warehouse. IEEE Transactions Knowledge and Data Engineering 17(1), 24–43 (2005)
Haider, M., Vijay Kumar, T.V.: Materialised Views Selection using Size and Query Frequency. International Journal of Value Chain Management (IJVCM) 5(2), 95–105 (2011)
Harinarayan, V., Rajaraman, A., Ullman, J.D.: Implementing data cubes efficiently. In: ACM SIGMOD International Conference on Management of Data, pp. 205–227 (1996)
Horng, J.T., Chang, Y.J., Liu, B.J., Kao, C.Y.: Materialized view selection using genetic algorithms in a data warehouse system. In: Proceedings of the World Congress on Evolutionary Computation, Washington, pp. 2221–2227 (1999)
Horng, J.T., Chang, Y.J., Liu, B.J.: Applying evolutionary algorithms to materialized view selection in a data warehouse. Soft Computing 7, 574–581 (2003)
Inmon, W.H.: Building the Data Warehouse, 3rd edn. Wiley, Dreamtech (2003)
Lee, M., Hammer, J.: Speeding Up Materialized View Selection in Data Warehouses Using A Randomized Algorithm. The International Journal of Cooperative Information Systems 10(3), 327–353 (2001)
Lin, W.Y., Kuo, I.C.: A genetic selection algorithm for OLAP data cubes. Knowledge and Information Systems 6(1), 83–102 (2004)
Mitchell, M.: An Introduction to Genetic Algorithms. The MIT Press (1999)
Mohania, M., Samtani, S., Roddick, J., Kambayshi, Y.: Advances and Research Directions in Data Warehousing Technology. Australian Journal of Information Systems 7(1) (1999)
Shukla, A., Deshpande, P.M., Naughton, J.F.: Materialized view selection for Multidimensional Datasets. In: Proceedings of VLDB, pp. 488–500 (1998)
Sivanandan, S.N., Deepa, S.N.: Introduction to Genetic Algorithms. Springer, Heidelberg (2008)
Vijay Kumar, T.V., Ghoshal, A.: A Reduced Lattice Greedy Algorithm for Selecting Materialized Views. In: Prasad, S.K., Routray, S., Khurana, R., Sahni, S. (eds.) ICISTM 2009. CCIS, vol. 31, pp. 6–18. Springer, Heidelberg (2009)
Vijay Kumar, T.V., Haider, M., Kumar, S.: Proposing candidate views for materialization. In: Prasad, S.K., Vin, H.M., Sahni, S., Jaiswal, M.P., Thipakorn, B. (eds.) ICISTM 2010. CCIS, vol. 54, pp. 89–98. Springer, Heidelberg (2010)
Vijay Kumar, T.V., Haider, M.: A Query Answering Greedy Algorithm for Selecting Materialized Views. In: Pan, J.-S., Chen, S.-M., Nguyen, N.T. (eds.) ICCCI 2010, Part II. LNCS (LNAI), vol. 6422, pp. 153–162. Springer, Heidelberg (2010)
Vijay Kumar, T.V., Haider, M.: Greedy Views Selection Using Size and Query Frequency. In: Unnikrishnan, S., Surve, S., Bhoir, D. (eds.) ICAC3 2011. CCIS, vol. 125, pp. 11–17. Springer, Heidelberg (2011)
Vijay Kumar, T.V., Haider, M., Kumar, S.: A View Recommendation Greedy Algorithm for Materialized Views Selection. In: Dua, S., Sahni, S., Goyal, D.P. (eds.) ICISTM 2011. CCIS, vol. 141, pp. 61–70. Springer, Heidelberg (2011)
Wang, Z., Zhang, D.: Optimal Genetic View Selection Algorithm Under Space Constraint. International Journal of Information Technology 11(5), 44–51 (2005)
Widom, J.: Research Problems in Data Warehousing. In: Proceedings of ICIKM, pp. 25–30 (1995)
Yu, J.X., Yao, Y.X., Choi, C., Gou, G.: Materialized view selection as constrained evolutionary optimization. The Journal of IEEE Transactions on Systems, Man, and Cybernetics - TSMC 33(4), 458–467 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vijay Kumar, T.V., Kumar, S. (2012). Materialized View Selection Using Genetic Algorithm. In: Parashar, M., Kaushik, D., Rana, O.F., Samtaney, R., Yang, Y., Zomaya, A. (eds) Contemporary Computing. IC3 2012. Communications in Computer and Information Science, vol 306. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32129-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-32129-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32128-3
Online ISBN: 978-3-642-32129-0
eBook Packages: Computer ScienceComputer Science (R0)