International Journal of Data Warehousing and Mining · 2006 · 17 citations · 0 references
ComputingComputer EngineeringComputer ScienceDatabasesParallel AlgorithmsParallel ComputingData ParallelismDatabase ManagementParallel ArchitecturesParallel Computer ArchitectureParallel DatabasesRelational DatabasesAllocationDynamic Load BalancingLoad Balancing For Data AccessParallel Data WarehousingParallel Database ArchitecturesParallel Database ProcessingParallel Database SystemsScalable Database Systems
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.