The MRE wrapper approach: enabling incremental view maintenance of data warehouses defined on multi-relation information sources

  • Authors:
  • Lingli Ding;Xin Zhang;Elke A. Rundensteiner

  • Affiliations:
  • Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA;Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA;Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA

  • Venue:
  • Proceedings of the 2nd ACM international workshop on Data warehousing and OLAP
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Some of the most recently proposed algorithms for the incremental maintenance of materialized data warehouses (DW), such as SWEEP and PSWEEP, offer several significant advantages over previous solutions, such as high-performance, no potential for infinite waits and reduced remote queries and thus reduced network and information source (IS) loads. However, similar to many other algorithms, they still have the restricting assumption that each IS can be composed of just one single relation. This is unrealistic in practice. In this paper, we hence propose a solution to overcome this restriction. The Multi-Relation Encapsulation (MRE) Wrapper supports multiple relations in ISs in a manner transparent to the rest of the environment. The MRE Wrapper treats one IS composed of multiple relations as if it were a single relation from the DW point of view; thus any existing incremental view maintenance algorithms can now be applied even to such complex ISs without any changes. Hence, our method maintains all advantages offered by existing algorithms in particular SWEEP and PSWEEP, while also achieving the additional desired features of being non-intrusive, efficient, flexible and well-behaved.