A general multidimensional data allocation method for multicomputer database systems

Abstract

Several studies have demonstrated that both the performance and scalability of a shared-nothing parallel database system depend on the physical layout of data across the processing nodes of the system. Today, data is allocated in these systems using horizontal partitioning strategies. Tiffs approach has a number of drawbacks. In recent years, several multidimensional data declustering techniques have been proposed to address these problems. However, these schemes are too restrictive, or optimized for a certain type of queries. In this paper, we introduce a new technique which is flexible, and performs well for general queries.