By Topic

Parallel generation of base relation snapshots for materialized view maintenance in data warehouse environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Saeki, S. ; Database Syst. Lab., Univ. of Aizu, Fukushima, Japan ; Bhalla, S. ; Hasegawa, M.

Data warehouses are used in many applications that depend on distributed systems. A data warehouse supports information processing by providing a single platform of integrated, historical data for doing analysis. Data warehouses provide the facility for integration in a world of unintegrated application systems. The contents of a data warehouse are evolved in an evolutionary, step-at-a-time fashion. A data warehouse organizes and stores the data needed for informational, analytical processing over a long historical time perspective. Data warehouses keep a materialized view (such as historical data), and user queries are processed using this view. The view has to be maintained to reflect the updates done against the base relations stored at the various distributed data sources. Detecting and extracting modifications from information sources is an integral part of a data warehouse. For unsophisticated sources, in practice it is often necessary to infer modifications by periodically comparing snapshots and backup copies of data from the source. This study considers the materialized view and its maintenance. Various implementation and performance evaluation of the differential snapshot algorithms have been compared for evaluation of suitable alternatives.

Published in:

Parallel Processing Workshops, 2002. Proceedings. International Conference on

Date of Conference:

2002