Parallel telemetric data warehouse balancing algorithm

One of the most important requirements of data warehouses is query response time. Amongst all methods of improving query performance, parallel processing (especially in shared nothing class) is one of the giving practically unlimited system's scaling possibility. The key problem in a parallel data warehouses is data allocation between system nodes. The problem is growing when nodes have different computational characteristics. In this paper we present an algorithm of balancing parallel data warehouse built on mentioned architecture. Balancing is realized by setting dataset size stored in each node. We exploited some well known data allocation schemas using space filling curves: Hilbert and Peano. Our conception is verified by a set of tests and its analysis.