Redundant array of inexpensive nodes for DWS

  • Authors:
  • Jorge Vieira;Marco Vieira;Marco Costa;Henrique Madeira

  • Affiliations:
  • Critical Software SA, Coimbra, Portugal;CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal;Critical Software SA, Coimbra, Portugal;CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal

  • Venue:
  • DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The DWS (Data Warehouse Striping) technique is a round-robin data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables are distributed by an arbitrary number of low-cost computers and the queries are executed in parallel by all the computers, guarantying a nearly optimal speed up and scale up. However, the use of a large number of inexpensive nodes increases the risk of having node failures that impair the computation of queries. This paper proposes an approach that provides Data Warehouse Striping with the capability of answering to queries even in the presence of node failures. This approach is based on the selective replication of data over the cluster nodes, which guarantees full availability when one or more nodes fail. The proposal was evaluated using the newly TPCDS benchmark and the results show that the approach is quite effective.