ABSTRACT
Materialized views have been found to be very effective at speeding up queries, and are increasingly being supported by commercial databases and data warehouse systems. However, whereas the amount of data entering a warehouse and the number of materialized views are rapidly increasing, the time window available for maintaining materialized views is shrinking. These trends necessitate efficient techniques for the maintenance of materialized views.
In this paper, we show how to find an efficient plan for the maintenance of a set of materialized views, by exploiting common subexpressions between different view maintenance expressions. In particular, we show how to efficiently select (a) expressions and indices that can be effectively shared, by transient materialization; (b) additional expressions and indices for permanent materialization; and (c) the best maintenance plan — incremental or recomputation — for each view. These three decisions are highly interdependent, and the choice of one affects the choice of the others. We develop a framework that cleanly integrates the various choices in a systematic and efficient manner. Our evaluations show that many-fold improvement in view maintenance time can be achieved using our techniques. Our algorithms can also be used to efficiently select materialized views to speed up workloads containing queries and updates.
- 1.AGRAWAL, S., CHAUDHURI, S., AND NARASAYYA, V. R. Automated selection of materialized views and indexes in SQL databases. In Intl. Conf. Very Large Databases (2000), pp. 496-505. Google ScholarDigital Library
- 2.BLAKELEY, J. A., LARSON, P.- A., AND TOMPA, F. W. Efficiently updating materialized views. In ACM SIGMOD Intl. Conf. on Management of Data (1986). Google ScholarDigital Library
- 3.BOBROWSKI, S. Using materialized views to speed up queries. Oracle Magazine (Sept. 1999).Google Scholar
- 4.COLBY, L., COLE, R. L., HASLAM, E., JAZAYERI, N., JOHNSON, G., MCKENNA, W. J., SCHUMACHER, L., AND WILHITE, D. Redbrick Vista: Aggregate computation and management. In Intl. Conf. on Data Engineering (1998). Google ScholarDigital Library
- 5.GRAEFE, G., AND MCKENNA, W. J. The Volcano Optimizer Generator: Extensibility and Efficient Search. In Intl. Conf. on Data Engineering (1993). Google ScholarDigital Library
- 6.GRIFFIN, T., AND LIBKIN, L. Incremental maintenance of views with duplicates. In ACM SIGMOD Intl. Conf. on Management of Data (1995). Google ScholarDigital Library
- 7.GUPTA, A., AND MUMICK, I. S. Maintenance of materialized views : Problems, techniques, and applications. IEEE Data Engineering Bulletin 18, 2 (June 1995).Google Scholar
- 8.GUPTA, H. Selection of views to materialize in a data warehouse. In Intl. Conf. on Database Theory (1997). Google ScholarDigital Library
- 9.HARINARAYAN, V., RAJARAMAN, A., AND ULLMAN, J. Implementing data cubes efficiently. In ACM SIGMOD Intl. Conf. on Management of Data (Montreal, Canada, June 1996). Google ScholarDigital Library
- 10.QUASS, D., GUPTA, A., MUMICK, I., AND WIDOM, J. Making views self-maintainable for data warehousing. In Intl. Conf. on Parallel and Distributed Information Systems (1996). Google ScholarDigital Library
- 11.ROSS, K., SRIVASTAVA, D., AND SUDARSHAN, S. Materialized view maintenance and integrity constraint checking: Trading space for time. In ACM SIGMOD Intl. Conf. on Management of Data (1996). Google ScholarDigital Library
- 12.ROUSSOPOLOUS, N. View indexing in relational databases. ACM Trans. on Database Systems 7, 2 (1982), 258-290. Google ScholarDigital Library
- 13.ROY, P., SESHADRI, S., SUDARSHAN, S., AND BHOBHE, S. Efficient and extensible algorithms for multi-query optimization. In ACM SIGMOD Intl. Conf. on Management of Data (2000). Google ScholarDigital Library
- 14.SELLIS, T. K. Multiple query optimization. ACM Transactions on Database Systems 13, 1 (1988). Google ScholarDigital Library
- 15.VISTA, D. Integration of incremental view maintenance into query optimizers. In Intl. Conf. on Extending Database Technology (EDBT) (1998). Google ScholarDigital Library
Index Terms
- Materialized view selection and maintenance using multi-query optimization
Recommendations
Materialized view selection and maintenance using multi-query optimization
Materialized views have been found to be very effective at speeding up queries, and are increasingly being supported by commercial databases and data warehouse systems. However, whereas the amount of data entering a warehouse and the number of ...
Multiple Materialized View Selection for XPath Query Rewriting
ICDE '08: Proceedings of the 2008 IEEE 24th International Conference on Data EngineeringWe study the problem of answering XPATH queries using multiple materialized views. Despite the efforts on answering queries using single materialized view, answering queries using multiple views remains relatively new. We address two important aspects ...
Materialized view selection using evolutionary algorithm for speeding up big data query processing
For speeding up query processing on Big Data, frequent sub-queries or views may be materialized such that the query processing cost is minimized with optimum cost of maintaining the materialized views and/or queries. Materializing frequent sub-queries ...
Comments