Abstract
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources each time. Data warehouses therefore build a large number of materialized views to increase system performance. However, materialized views need to be immediately updated when its sources are changed, leading to a possible decrease in system performance. The goal of the materialized view selection problem is to select an appropriate set of views that minimize total query response time as well as the view maintenance cost. In this paper, we develop a solution for identifying the candidate view space of materialization. In particular, we present algorithms for generating a union-view and a partial-view, both of which are good candidates for materialization. The proposed candidate view space guarantees to find a polynomial bounded set of optimal views, and any selection algorithm from previous research, e.g. greedy algorithm, can be ran on the candidate view space to find the optimal materialized 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
Agrawal, S., Chaudhuri, S., Narasayya, V.: Automated Selection of MaterializedViews and Indexes for SQL databases, Materialized View Selection in Multidimensional Database. In: Proc. of VLDB, pp. 59–68 (2001)
Baralis, E., Paraboschi, S., Teniente, E.: Materialized View Selection in Multidimensional Database. In: Proc. of VLDB, pp.156–165 (1997)
Rada Chirkova, Alon Y.Halevy, Dan Suciu: Formal Perspective on the View Selection Problem. In: Proc. of VLDB, pp.59–68 (2001)
Chang, J., Lee, S.: Extended Conditions for Answering an Aggregate Query Using Materialized Views. Information Processing Letters 72(5-6), 205–212 (1999)
Gupta, H., Harinarayan, V., Rajaraman, A., Ullman, J.: Index Selection for OLAP. In: Proc. of ICDE, pp.208–219 (1997)
Gupta, H.: Selection of Views to Materialize in a Data Warehouse. In: Proc. of ICDT, pp. 98–112 (1997)
Gupta, H., Mumick, I.S.: Selection of views to materialize under a Maintenance cost constraint. In: Proc. of ICDT, pp. 453–460 (1999)
Harinarayan, V., Rajaraman, A., Ullman, J.: Implementing Data Cubes Efficiently. In: Proc. of ACM SIGMOD, pp. 205–216 (1996)
Lee, T., Chang, J.: Selecting Materialized Views in Data Warehouses, Technical Report, Seoul National University (2000)
Mistry, H., Roy, P., Sudarshan, S., Ramamritham, K.: Materialized View Selection and Maintenance Using Multi-Query Optimization. In: proc. of ACM SIGMOD, pp. 310–318 (2001)
Shukla, A., Deshpande, P.M., Naughton, J.F.: Materialized View Selection for Multidimensional DataSet. In: Proc. of VLDB, pp. 488–499 (1998)
Timos, K.: Sellis: Multiple-query Optimization. ACM Transactions on Database Systems, 23–52 (1988)
Theodoratos, D., Sellis, T.: Data Warehouse Configuration. In: Proc. of VLDB, pp. 126–135 (1997)
Yang, J., Karlapalem, K., Li, Q.: Algorithms for Materialized View Design in Data Warehousing Environment. In: Proc. of VLDB (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, T., Chang, Jy., Lee, Sg. (2004). Using Relational Database Constraints to Design Materialized Views in Data Warehouses. In: Yu, J.X., Lin, X., Lu, H., Zhang, Y. (eds) Advanced Web Technologies and Applications. APWeb 2004. Lecture Notes in Computer Science, vol 3007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24655-8_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-24655-8_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21371-0
Online ISBN: 978-3-540-24655-8
eBook Packages: Springer Book Archive