A Parallel Implementation Scheme of Relational Tables Based on Multidimensional Extendible Array

View Sample PDF

Author(s): K. M. Azharul Hasan (University of Fukui, Japan), Tatsuo Tsuji (University of Fukui, Japan)and Ken Higuchi (University of Fukui, Japan)
Copyright: 2008
Pages: 21
Source title: Data Warehousing and Mining: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): John Wang (Montclair State University, USA)
DOI: 10.4018/978-1-59904-951-9.ch210

Keywords: Data Mining and Databases / Data Warehousing / Information Science Reference / Library & Information Science

Purchase

View A Parallel Implementation Scheme of Relational Tables Based on Multidimensional Extendible Array on the publisher's website for pricing and purchasing information.

Abstract

In this article, an efficient parallel implementation scheme of relational tables is proposed and evaluated. The scheme implements a relational table by employing an extendible multidimensional array. Data allocation is a key performance factor for parallel database systems. This holds especially for data warehousing environments in which huge amounts of data have to be dealt with. In our scheme, an efficient data allocation technique is used, based on the notion of extendible array. The dynamic load balancing is conducted when load on each processor is not uniformly distributed in order to maximize processor utilization.

The IRMA Community

Research IRM

A Parallel Implementation Scheme of Relational Tables Based on Multidimensional Extendible Array

Purchase

Abstract

Related Content

IRMA Sponsors