Optimized cost effective approach for selection of materialized views in data warehousing


  • B. Ashadevi Department of MCA, Velalar College of Engineering and Technology, Erode, Tamil Nadu, India
  • R. Balasubramanian Velammal Engineering College, Chennai, Tamil Nadu, India


Data Warehousing, Views, Materialization, View selection, View-Maintenance, Query processing cost, Storage space


A data warehouse efficiently processes a given set of queries by utilizing the multiple materialized views. Owing to the constraint on space and maintenance cost, the materialization of all views is unfeasible. One of the critical decisions involved in the process of designing a data warehouse for optimal efficiency, is the materialized views selection. The primary goal of data warehousing is to select a suitable set of views that minimizes the total cost associated with the materialized views. In this paper, we have presented a framework, an optimized version of our previous work, for the selection of views to materialize, for a given storage space constraints, which intends to achieve the best combination of good query response, low query processing cost and low view maintenance cost. All the cost metrics associated with the materialized views selection that comprise the query execution frequencies, base-relation update frequencies, query access costs, view maintenance costs and the system's storage space constraints are considered by this framework. This framework optimizes the maintenance, storage and query processing cost as it selects the most cost effective views to materialize. Thus, an efficient data warehousing system is the outcome.


Download data is not yet available.


[1] Y. Zhuge, H. Garcia-Molina, J. Hammer, and J. Widom, "View Maintenance in a Warehousing Environment." In Proceedings of the ACM SIGMOD Conference, San Jose, California, May 1995.
[2] S. Chaudhuri and U. Dayal. “An Overview of Data Warehousing and OLAP Technology”. SIGMOD Record, vol: 26, no: 1, pp: 65-74, 1997.
[3] J. X. Yu, X. Yao, C. Choi and G. Gou. Materialized view selection as constrained evolutionary optimization. IEEE Transactions on Systems, Man and Cybernetics, Part C, vol: 33, no: 4, pp: 458–467, 2003.
[4] C. Zhang, X. Yao, and J. Yang. An evolutionary Approach to Materialized View Selection in a Data Warehouse Environment. IEEE Transactions on Systems, Man and Cybernetics, vol. 31, no.3, pp. 282–293, 2001.
[5] K. Aouiche, P. Jouve, and J. Darmont. Clustering-based materialized view selection in data warehouses. In ADBIS’06, volume 4152 of LNCS, pages 81–95, 2006.
[6] H. Gupta, I.S. Mumick, Selection of views to materialize under a maintenance cost constraint. In Proc. 7th International Conference on Database Theory (ICDT'99), Jerusalem, Israel, pp. 453–470, 1999.
[7] V. Harinarayan, A. Rajaraman, and J. Ullman. “Implementing data cubes efficiently”. Proceedings of ACM SIGMOD 1996 International Conference on Management of Data, Montreal, Canada, pages 205--216, 1996.
[8] J.Yang, K. Karlapalem, and Q. Li. “A framework for designing materialized views in data warehousing environment”. Proceedings of 17th IEEE International conference on Distributed Computing Systems, Maryland, U.S.A., May 1997.
[9] H. Gupta. “Selection of Views to Materialize in a Data Warehouse”. Proceedings of International Conference on Database Theory, Athens, Greece 1997.
[10] A. Shukla, P. Deshpande, and J. F. Naughton, “Materialized view selection for multidimensional datasets,” in Proc. 24th Intl. Conf. Very Large Data Bases, pp. 488–499, 1998.
[11] S. Agrawal, S. Chaudhuri, and V. Narasayya, “Automated Selection of Materialized Views and Indexes in SQL Databases,” Proceedings of International Conference on Very Large Database Systems, 2000.
[12] P. Kalnis, N. Mamoulis, and D. Papadias, “View Selection Using Randomized Search,” Data and Knowledge Eng., vol. 42, no. 1, 2002.
[13] Gupta, H. & Mumick, I., Selection of Views to Materialize in a Data Warehouse. IEEE Transactions on Knowledge and Data Engineering, vol: 17, no: 1, pp: 24-43, 2005.
[14] M. Lee and J. Hammer, Speeding up materialized view selection in data warehouses using a randomized algorithm, International Journal of Cooperative Information Systems, 10(3):327–353, 2001.
[15] C. Zhang and J. Yang, “Genetic algorithm for materialized view selection in data warehouse environments,” Proceedings of the International Conference on Data Warehousing and Knowledge Discovery , LNCS, vol. 1676, pp. 116–125, 1999.
[16] C. -H. Choi, J. X. Yu, and G. Gou, “What difference heuristics make: Maintenance-cost view-selection revisited,” in Proc. Third Int. Conf. Web-Age Information Management, 2002.
[17] Ziqiang Wang and Dexian Zhang, Optimal Genetic View Selection Algorithm Under Space Constraint, International Journal of Information Technology, vol. 11, no. 5, pp. 44 - 51, 2005.
[18] Gang Gou; Yu, J.X.; Hongjun Lu., "A* search: an efficient and flexible approach to materialized view selection Systems," IEEE Transactions on Man, and Cybernetics, Part C: Applications and Reviews, Vol. 36, no. 3, May 2006 pp: 411 - 425.
[19] B.Ashadevi, R.Balasubramanian, "Cost Effective Approach for Materialized Views Selection in Data Warehousing Environment", proc. of the International Journal of Computer Science and Network security Vol. 8, No. 10, pp. 236-242, 2008.




How to Cite

Ashadevi, B., & Balasubramanian, R. (2009). Optimized cost effective approach for selection of materialized views in data warehousing. Journal of Computer Science and Technology, 9(01), p. 21–26. Retrieved from https://journal.info.unlp.edu.ar/JCST/article/view/738



Original Articles