An Efficient Scalable Parallel View Maintenance Algorithm for Shared Nothing Multi-processor Machines

Authors:
M. Bamha;Fadila Bentayeb;Gaétan Hains
Affiliations:
-;-;-
Venue:
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Year:
1999

Citing 8
Cited 1

A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Parallel evaluation of multi-join queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Incremental maintenance of views with duplicates

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Query Processing in Parallel Relational Database Systems

Query Processing in Parallel Relational Database Systems
A Performance Evaluation of Load Balancing Techniques for Join Operations on Multicomputer Database Systems

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Practical Skew Handling in Parallel Joins

VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Estimation of Query-Result Distribution and its Application in Parallel-Join Load Balancing

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
A Case for Parallelism in Data Warehousing and OLAP

DEXA '98 Proceedings of the 9th International Workshop on Database and Expert Systems Applications

An optimal skew-insensitive join and multi-join algorithm for distributed architectures

DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 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 BSP1 cost model which predicts a near-linear speedup.