Dynamic Allocation in a Self-Scaling Cluster Database

Abstract. Database systems have been vital for all forms of data processing for a long time. In recent years, the amount of processed data has been growing dramatically, even in small projects. Nevertheless, database management systems tend to be static in terms of size and performance, which makes scaling a difficult and expensive task. This is especially an acute problem in dynamic environments like grid systems. Based on the C-JDBC project, we developed a cluster database that supports automatic scaling in the number of nodes used. To ensure good load balancing, we distribute the tablespace according to a statistical analysis of the query history. In this paper we will focus on the allocation algorithm.