@inproceedings{7af9b2c433df46dba286ca9889ff93aa,
title = "Online balancing of aR-tree indexed distributed spatial data warehouse",
abstract = "One of the key 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 complexity of data warehouse systems is very high with respect to system structure, data model and many mechanisms used, which have a strong influence on the overall performance. The main problem in a parallel data warehouse balancing 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 distributed data warehouse built on shared nothing architecture. Balancing is realized by iterative setting dataset size stored in each node. We employ some well known data allocation schemes using space filling curves: Hilbert and Peano. We provide a collection of system tests results and its analysis that confirm the possibility of a balancing algorithm realization in a proposed way.",
author = "Marcin Gorawski and Robert Chechelski",
year = "2006",
doi = "10.1007/11752578\_57",
language = "English",
isbn = "3540341412",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "470--477",
booktitle = "Parallel Processing and Applied Mathematics - 6th International Conference, PPAM 2005, Revised Selected Papers",
note = "6th International Conference on Parallel Processing and Applied Mathematics, PPAM 2005 ; Conference date: 11-09-2005 Through 14-09-2005",
}