Abstract
View selection generally deals with selecting an optimal set of beneficial views for materialization subject to constraints like space, response time, etc. The problem of view selection has been shown to be in NP. Several greedy view selection algorithms exist in literature, most of which are focused around algorithm HRU, which uses a multidimensional lattice framework to determine a good set of views to materialize. Algorithm HRU exhibits a high run time complexity. One reason for it may be the high number of re-computations of benefit values needed for selecting views for materialization. This problem has been addressed by the algorithm Reduced Lattice Greedy Algorithm (RLGA) proposed in this paper. Algorithm RLGA selects beneficial views greedily over a reduced lattice, instead of the complete lattice as in the case of HRU algorithm. The use of the reduced lattice, containing a reduced number of dependencies among views, would lead to overall reduction in the number of re-computations required for selecting materialized views. Further, it was also experimentally found that RLGA, in comparison to HRU, was able to select fairly good quality views with fewer re-computations and an improved execution time.
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
Agrawal, S., Chaudhuri, S., Narasayya, V.: Automated Selection of Materialized Views and Indexes for SQL Databases. In: 26th VLDB Conference, Cairo, Egypt, pp. 496–505 (2000)
Baralis, E., Paraboshi, S., Teniente, E.: Materialized view selection in a multidimensional database. In: 23rd VLDB Conference, pp. 156–165 (1997)
Chan, G.K.Y., Li, Q., Feng, L.: Optimized Design of Materialized Views in a Real-Life Data Warehousing Environment. International Journal of Information Technology 7(1), 30–54 (2001)
Chirkova, R., Halevy, A.Y., Suciu, D.: A formal perspective on the view selection problem. In: 27 VLDB Conference, Italy, pp. 59–68 (2001)
Encinas, M.T.S., Montano, J.A.H.: Algorithms for selection of materialized views: based on a costs model. In: Eighth Mexican International Conference on Current Trends in Computer Science, pp. 18–24. IEEE, Los Alamitos (2007)
Gou, G., Yu, J.X., Choi, C.H., Lu, H.: An Efficient and Interactive A*- Algorithm with Pruning Power- Materialized View Selection Revisited. In: DASFAA, p. 231 (2003)
Gupta, H., Mumick, I.S.: Selection of Views to Materialize in a Data Warehouse. IEEE Transactions on Knowledge and Data Engineering 17(1), 24–43 (2005)
Gupta, H., Harinarayan, V., Rajaraman, A., Ullman, J.D.: Index Selection for OLAP. In: 13th ICDE Conference, pp. 208–219 (1997)
Gupta, H.: Selection of Views to Materialize in a Data Warehouse. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 98–112. Springer, Heidelberg (1996)
Hanson, E.R.: A Performance Analysis of View Materialization Strategies. In: ACM SIGMOD Management of Data, pp. 440–453 (1987)
Harinarayan, V., Rajaraman, A., Ullman, J.: Implementing Data Cubes Efficiently. In: Proc. ACM SIGMOD, Montreal, Canada, pp. 205–216 (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: IEEE CEC, vol. 2, p. 2227 (1999)
Lawrence, M.: Multiobjective Genetic Algorithms for Materialized View Selection in OLAP Data Warehouses. In: ACM GECCO 2006, US, pp. 699–706 (2006)
Nadeua, T.P., Teorey, T.J.: Achieving Scalability in OLAP Materialized View Selection. In: DOLAP 2002, pp. 28–34. ACM, New York (2002)
Shah, B., Ramachandaran, K., Raghavan, V.: A Hybrid Approach for Data Warehouse View Selection. International Journal of Data Warehousing and Mining 2(2), 1–37 (2006)
Teschke, M., Ulbrich, A.: Using Materialized Views to Speed Up Data Warehousing (1997)
Theodoratos, D., Bouzeghoub, M.: A General Framework for the View Selection Problem for Data Warehouse Design and Evolution. In: 3rd ACM Intl. Workshop on Data Warehousing and On-Line Analytical Processing (DOLAP 2000), Washington, DC., U.S.A., pp. 1–8. ACM Press, New York (2000)
Uchiyama, H., Runapongsa, K., Teorey, T.J.: A Progressive View Materialization Algorithm. In: ACM DOLAP, Kansas city, USA, pp. 36–41 (1999)
Valluri, R., Vadapalli, S., Karlapalem, K.: View Relevance Driven Materialized View Selection in Data Warehousing Environment. In: 13th Autralasian Database Conference (ADC 2002), Melbourne, Autralia, vol. 24(2), pp. 187–196 (2002)
Yin, G., Yu, X., Lin, L.: Strategy of Selecting Materialized Views Based on Cache-updating. In: IEEE International Conference on Integration Technology, ICIT 2007 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vijay Kumar, T.V., Ghoshal, A. (2009). A Reduced Lattice Greedy Algorithm for Selecting Materialized Views. In: Prasad, S.K., Routray, S., Khurana, R., Sahni, S. (eds) Information Systems, Technology and Management. ICISTM 2009. Communications in Computer and Information Science, vol 31. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00405-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-00405-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00404-9
Online ISBN: 978-3-642-00405-6
eBook Packages: Computer ScienceComputer Science (R0)