An efficient scalable parallel view maintenance algorithm for shared nothing multi-processor machines
type: Dataset
description: The problem of maintenance of materialized views has been the object of increased research activity recently mainly because of applications related to data warehousing. Many sequential view maintenance algorithms are developed in the literature. If the view is defined by a relational expression involving join operators, the cost of re-evaluating the view even incrementally may be unacceptable. Moreover, when views are {\it materialized}, parallelism can greatly increase processing power as necessary for view maintenance. In this paper, we present a new parallel join algorithm by partial duplication of data and a new parallel view maintenance algorithm where views can involve multi-joins. The performances of these algorithms are analyzed using the scalable and portable BSP (Bulk Synchronous Parallelism) cost model which predicts a near-linear speedup.
keyword: conference-papers
keyword: data-skew
keyword: data-warehouse
keyword: dynamic-load-balancing
keyword: infoeu-reposemanticsconferenceobject
keyword: materialized-view-maintenance
keyword: multi-joins
keyword: parallel-incremental-algorithm
keyword: pdbms--parallel-database-management-systems
keyword: sccocompcognitive-sciencecomputer-science
issued: 2026-05-11T11:54:12.527064
modified: 2026-05-11T11:54:12.527070
language: en
contact point: Organization
  fn: CCSD

test_moissonnage_selune
type: Agent

An efficient scalable parallel view maintenance algorithm for shared nothing multi-processor machines
type: Distribution
format: HTML
access URL: https://hal.science/hal-00081355
issued: 2026-05-11T11:54:12.545630
modified: 2026-05-11T11:54:12.513162