Reducing the cost of accessing relations in incremental view maintenance

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. (c) 2006 Elsevier B.V All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2007-03
Language
ENG
Keywords

MULTIPLE-QUERY OPTIMIZATION; ALGORITHM

Citation

DECISION SUPPORT SYSTEMS, v.43, no.2, pp.512 - 526

ISSN
0167-9236
URI
http://hdl.handle.net/10203/1976
Appears in Collection
CS-Journal Papers(저널논문)
  • Hit : 623
  • Download : 162
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 2 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0