Reducing the cost of accessing relations in incremental view maintenance

  • Authors:

  • Ki Yong Lee;Jin Hyun Son;Myoung Ho Kim

  • Affiliations:

  • Department of Electrical Engineering and Computer Science, KAIST, 373-1 Guseong-dong, Yuseong-gu, Daejeon, 305-701, South Korea;Department of Computer Science and Engineering, Hanyang University, 1271 Sa-1 dong, Ansan, Kyunggi-Do, 425-791, South Korea;Department of Electrical Engineering and Computer Science, KAIST, 373-1 Guseong-dong, Yuseong-gu, Daejeon, 305-701, South Korea

  • Venue:
  • Decision Support Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the data warehouse environment, the concept of a materialized view is common and important for efficient support of OLAP query processing. Materialized views are generally derived from several relations. These materialized views need to be updated when source relations change. Since the propagation of updates to the views may impose a significant overhead, it is essential to update the warehouse views efficiently. Though various view maintenance strategies have been discussed in the past, optimizations on the total accesses to relations have not been sufficiently investigated. In this paper we propose an efficient incremental view maintenance method called optimal delta evaluation that can minimize the total accesses to relations. We first present the delta evaluation expression and a delta evaluation tree which are core concepts of the method. Then, a dynamic programming algorithm that can find the optimal delta evaluation tree is proposed. We also present various experimental results that show the usefulness and efficiency of our proposed method.