Abstract
A data warehouse stores historical data to support analytical query processing. These analytical queries are long and complex and processing these against a large data warehouse consumes a lot of time. As a result, the query response time is high. One way to reduce this time is by selecting views that are likely to answer a large number of future queries and storing them in a data warehouse. This problem is referred to as view selection. Several view selection algorithms have been proposed with most of these being focused around HRUA. HRUA considers the size of the views to select the most beneficial view for materialization. The views selected using HRUA, though beneficial with respect to size, may be unable to account for large numbers of queries and thus making them an unnecessary overhead. The algorithm proposed in this paper attempts to address this problem by considering query frequency, along with the size, of the view to select Top-K views for materialization. The proposed algorithm, in each iteration, computes the profit, defined in terms of size and query frequency, and then selects the most profitable view for materialization. As a result, the views selected are beneficial with respect to size and have the ability to answer future queries. Further, experimental results show that the proposed algorithm, in comparison to HRUA, is able to select views capable of answering larger number of queries against a slight increase in the total cost of evaluating all the views. This in turn would result in efficient decision making.
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
Agarwal, S., Chaudhuri, S., Narasayya, V.: Automated Selection of materialized views and indexes for SQL Databases. In: Proceedings Of VLDB, pp. 496–505 (2000)
Aouiche, K., Jouve, P.-E., Darmont, J.: Clustering-Based Materialized View Selection in Data Warehouses. In: Manolopoulos, Y., Pokorný, J., Sellis, T.K. (eds.) ADBIS 2006. LNCS, vol. 4152, pp. 81–95. Springer, Heidelberg (2006)
Aouiche, K., Darmont, J.: Data mining-based materialized view and index selection in data warehouse. Journal of Intelligent Information Systems, 65–93 (2009)
Baralis, E., Paraboschi, S., Teniente, E.: Materialized View Selection in a Multidimensional Database. In: Proceedings of VLDB 1997, pp. 156–165. Morgan Kaufmann Publishers, San Francisco (1997)
Gupta, H., Harinarayan, V., Rajaraman, A., Ullman, J.: Index Selection in OLAP. In: Proceedings ICDE 1997, pp. 208–219. IEEE Computer Society (1997)
Gupta, H., Mumick, I.: Selection of Views to Materialize in a Data Warehouse. IEEE Transactions on Knowledge and Data Engineering 17(1), 24–43 (2005)
Harinarayan, V., Rajaraman, A., Ullman, J.: Implementing Data Cubes Efficiently. In: Proceedings of SIGMOD, pp. 205–216. ACM Press (1996)
Inmon, W.H.: Building the Data Warehouse, 3rd edn. Wiley Dreamtech (2003)
Lehner, R., Ruf, T., Teschke, M.: Improving Query Response Time in Scientific Databases Using Data Aggregation. In: Proceedings of 7th International Conference and Workshop on Databases and Expert System Applications, pp. 9–13 (September 1996)
Nadeau, T.P., Teorey, T.J.: Achieving scalability in OLAP materialized view selection. In: Proceedings of DOLAP 2002, pp. 28–34. ACM Press (2002)
Roussopoulos, N.: Materialized Views and Data Warehouse. In: 4th Workshop KRDB 1997, Athens, Greece (August 1997)
Serna-Encinas, M.T., Hoya-Montano, J.A.: Algorithm for selection of materialized views: based on a costs model. In: Proceeding of Eighth International Conference on Current Trends in Computer Science, pp. 18–24 (2007)
Shah, B., Ramachandran, K., Raghavan, V.: A Hybrid Approach for Data Warehouse View Selection. International Journal of Data Warehousing and Mining 2(2), 1–37 (2006)
Shukla, A., Deshpande, P., Naughton, J.: Materialized View Selection for Multidimensional Datasets. In: Proceedings of VLDB 1998, pp. 488–499. Morgan Kaufmann Publishers (1998)
Teschke, M., Ulbrich, A.: Using Materialized Views to Speed Up Data Warehousing, Technical Report, IMMD 6. Universität Erlangen-Nümberg (1997)
Theodoratos, D., Bouzeghoub, M.: A general framework for the view selection problem for data warehouse design and evolution. In: Proceedings of DOLAP, pp. 1–8 (2000)
Uchiyama, H., Ranapongsa, K., Teorey, T.J.: A Progressive View Materialization Algorithm. In: Proceeding of 2nd ACM International Workshop on Data Warehousing and OLAP, Kansas City Missouri, USA, pp. 36–41 (1999)
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)
Zhang, C., Yao, X., Yang, J.: An Evolutionary Approach to Materialized Views Selection in a Data Warehouse Environment. IEEE Transactions on Systems, Man and Cybernatics, 282–294 (2001)
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., Haider, M. (2012). Materialized Views Selection for Answering Queries. In: Kannan, R., Andres, F. (eds) Data Engineering and Management. ICDEM 2010. Lecture Notes in Computer Science, vol 6411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27872-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-27872-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27871-6
Online ISBN: 978-3-642-27872-3
eBook Packages: Computer ScienceComputer Science (R0)