A parallel view maintenance algorithm for complete consistency

Abstract

In recent years, numerous algorithms have been proposed for View Maintenance of Data Warehouses (DWs). Most of these algorithms concentrate on maintaining a complete level of consistency. Transactions containing concurrent updates with parallel View Maintenance complicate the consistency problem. The PVM-MED WRAP algorithm is an efficient parallel DW View Maintenance algorithm that manipulates concurrent updates in a distributed multi-relation sources environment. However, this algorithm only ensures the Convergence level of consistency. This paper extends the PVM-MED WRAP algorithm to achieve the Complete level of consistency, and presents a scalable architecture for the proposed algorithm Simulation results demonstrate that extending the P VMMEDWRAP algorithm to achieve the Complete level of consistency limits the maximal parallelism feature, and hence decreases the performance improvement of the system. But this is the price in terms ofperformance in order to achieve fhe Complete level of consistency.