Preprocessing for fast refreshing materialized views in DB2

  • Authors:
  • Wugang Xu;Calisto Zuzarte;Dimitri Theodoratos;Wenbin Ma

  • Affiliations:
  • New Jersey Institute of Technology;IBM Canada Ltd.;New Jersey Institute of Technology;IBM Canada Ltd.

  • Venue:
  • DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

Materialized views (MVs) are used in databases and data warehouses to greatly improve query performance. In this context, a great challenge is to exploit commonalities among the views and to employ multi-query optimization techniques in order to derive an efficient global evaluation plan for refreshing the MVs concurrently. IBMDB2$^{\rm {\textregistered}}Universal Database^{\texttrademark}$ (DB2 UDB) provides two query matching techniques, query stacking and query sharing, to exploit commonalities among the MVs, and to construct an efficient global evaluation plan. When the number of MVs is large, memory and time restrictions prevent us from using both query matching techniques in constructing efficient global plans. We suggest an approach that applies the query stacking and query sharing techniques in different steps. The query stacking technique is applied first, and the outcome is exploited to define groups of MVs. The number of MVs in each group is restricted. This allows the query sharing technique to be applied only within groups in a second step. Finally, the query stacking technique is used again to determine an efficient global evaluation plan. An experimental evaluation shows that the execution time of the plan generated by our approach is very close to that of the plan generated using both query matching techniques without restriction. This result is valid no matter how big the database is.