Affiliations: Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Poland, stencel@mat.umk.pl; pawel.leszczynski@mat.umk.pl
Note: [] Address for correspondence: Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Poland
Abstract: In recent years, the scalability of web applications has become critical. Web sites get more dynamic and customized. This increases servers' workload. Furthermore, the future increase of load is difficult to predict. Thus, the industry seeks for solutions that scale well. With current technology, almost all items of system architectures can be multiplied when necessary. There are, however, problems with databases in this respect. The traditional approach with a single relational database has become insufficient. In order to achieve scalability, architects add a number of different kinds of storage facilities. This could be error prone because of inconsistencies in stored data. In this paper we present a novel method to assemble systems with multiple storages. We propose an algorithm for update propagation among different storages like multi-column, key-value, and relational databases.
Keywords: multi storage, scalability, key-value storage, column family storage, data consistency, web applications
