Geodesic
Applying Stochastic Metaheuristics to the Problem of Data Management in a Multi-Tenant Database Cluster
Modelirovanie i analiz informacionnyh sistem, Tome 21 (2014) no. 4, pp. 13-24 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

A multi-tenant database cluster is a concept of a data-storage subsystem for cloud applications with the multi-tenant architecture. The cluster is a set of relational database servers with the single entry point, combined into one unit with a cluster controller. This system is aimed to be used by applications developed according to Software as a Service (SaaS) paradigm and allows to place tenants at database servers so that providing their isolation, data backup and the most effective usage of available computational power. One of the most important problems about such a system is an effective distribution of data into servers, which affects the degree of individual cluster nodes load and fault-tolerance. This paper considers the data-management approach, based on the usage of a load-balancing quality measure function. This function is used during initial placement of new tenants and also during placement optimization steps. Standard schemes of metaheuristic optimization such as simulated annealing and tabu search are used to find a better tenant placement.
Keywords: databases, SaaS, stochastic optimization.
Mots-clés : multi-tenant architecture 
@article{MAIS_2014_21_4_a1,
     author = {E. A. Boytsov},
     title = {Applying {Stochastic} {Metaheuristics} to the {Problem} of {Data} {Management} in a {Multi-Tenant} {Database} {Cluster}},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {13--24},
     year = {2014},
     volume = {21},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2014_21_4_a1/}
}
TY  - JOUR
AU  - E. A. Boytsov
TI  - Applying Stochastic Metaheuristics to the Problem of Data Management in a Multi-Tenant Database Cluster
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2014
SP  - 13
EP  - 24
VL  - 21
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MAIS_2014_21_4_a1/
LA  - ru
ID  - MAIS_2014_21_4_a1
ER  - 
%0 Journal Article
%A E. A. Boytsov
%T Applying Stochastic Metaheuristics to the Problem of Data Management in a Multi-Tenant Database Cluster
%J Modelirovanie i analiz informacionnyh sistem
%D 2014
%P 13-24
%V 21
%N 4
%U http://geodesic.mathdoc.fr/item/MAIS_2014_21_4_a1/
%G ru
%F MAIS_2014_21_4_a1
E. A. Boytsov. Applying Stochastic Metaheuristics to the Problem of Data Management in a Multi-Tenant Database Cluster. Modelirovanie i analiz informacionnyh sistem, Tome 21 (2014) no. 4, pp. 13-24. http://geodesic.mathdoc.fr/item/MAIS_2014_21_4_a1/

[1] F. Chong, G. Carraro, Architecture Strategies for Catching the Long Tail, , 2006 http://msdn.microsoft.com/en-us/library/aa479069.aspx

[2] F. Chong, G. Carraro, R. Wolter, Multi-Tenant Data Architecture, , 2006 http://msdn.microsoft.com/en-us/library/aa479086.aspx

[3] E. Boytsov, V. Sokolov, “The Problem of Creating Multi-Tenant Database Clusters”, Proceedings of SYRCoSE (Perm, 2012), 172–177

[4] E. Boytsov, “Designing and Development of the Imitation Model of a Multi-Tenant Database Cluster”, Modeling and Analysis of Information Systems, 20:4 (2013), 136–149

[5] E. Boytsov, V. Sokolov, “The Formal Statement of the Load-Balancing Problem for a Multi-Tenant Database Cluster With a Constant Flow of Queries”, Proceedings of the Spring/Summer Young Researchers' Colloquium on Software Engineering (Kazan, 2013), 117–121

[6] E. Boytsov, V. Sokolov, “Comparison of Data Management Strategies for Multi-Tenant Database Cluster”, Proceedings of the International Symposium on Business Modelling and Software Design (Luxembourg, 2014), 217–222

[7] M. Beckman, T. Koopmans, “Assignment problems and the location of economic activities”, Econometrica, 25 (1957), 53–76 | DOI | MR | Zbl

[8] C.-G. Lee, Z. Ma, The generalized quadratic assignment problem, Rep., University of Toronto, Department of Mechanical and Industrial Engineering, Toronto, Canada, 2004

[9] S. Sahni, T. Gonzalez, “P-Complete Approximation Problems”, Journal of ACM, 23:3 (1976), 555–565 | DOI | MR | Zbl

[10] R. Burkard, “Locations with spatial interactions: The quadratic assignment problem”, Discrete location theory, 1991, 387–437 | MR

[11] F. Rendl, P. Pardalos, H. Wolkowicz, “The Quadratic Assignment Problem: A Survey and Recent Developments”, Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16, American Mathematical Society, 1994, 1–42 | MR

[12] R. Burkard, E. Cela, “Quadratic and three-dimensional assignment problems”, Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester, 1997, 373–392

[13] J. H. Holland, Adaptation in Natural and Artificial Systems, MIT Press, Cambridge, 1992 | MR

[14] S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, “Optimization by simulated annealing”, SCIENCE, 220:4598 (1983), 671–680 | DOI | MR | Zbl

[15] F. Glover, “Future Paths for Integer Programming and Links to Artificial Intelligence”, Computers and Operation Research, 13:5 (1986), 533–549 | DOI | MR | Zbl

[16] A. Elmore, S. Das, D. Agrawal, A. El Abbadi, “Zephyr: Live Migration in Shared Nothing Databases for Elastic Cloud Platforms”, Proceedings of the ACM SIGMOD International Conference on Management of Data (New York, 2011), 301–312