Sciweavers

CONCURRENCY
2008

Dynamic allocation in a self-scaling cluster database

13 years 4 months ago
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.
Tilmann Rabl, Marc Pfeffer, Harald Kosch
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CONCURRENCY
Authors Tilmann Rabl, Marc Pfeffer, Harald Kosch
Comments (0)