Skip to main content
SpringerLink
Log in

Applying stochastic metaheuristics to the problem of data management in a multi-tenant database cluster

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

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 it may provide their isolation, data backup and the most effective usage of available computational power. One of the most important problems on such a system is an effective distribution of data between 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 the 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chong, F. and Carraro, G., Building Distributed Applications: Architecture Strategies for Catching the Long Tail Microsoft Development Network, 2006. http://msdn.microsoft.com/en-us/library/aa479069.aspx

    Google Scholar 

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

    Google Scholar 

  3. Boytsov, E. and Sokolov, V., The problem of creating multi-tenant database clusters, Proc. SYRCoSE, Perm, 2012, pp. 172–177.

    Google Scholar 

  4. Boytsov, E.A., Designing and development of an imitation model of a multi-tenant database cluster, Model. Analis Inform. Sist., 2013, vol. 20, no. 4, pp. 136–149.

    Google Scholar 

  5. Boytsov, E. and Sokolov, V., The formal statement of the load-balancing problem for a multi-tenant database cluster, Proc. Spring/Summer Young Researchers’ Colloq. on Software Engineering, Kazan, 2013, pp. 117–121.

    Google Scholar 

  6. Boytsov, E. and Sokolov, V., Comparison of data management strategies for multi-tenant database cluster, Proc. Int. Symp. on Business Modeling and Software Design, Luxembourg, 2014, pp. 217–222.

    Chapter  Google Scholar 

  7. Beckman, M. and Koopmans, T., Assignment problems and the location of economic activities, Econometrica, 1957, vol. 25, pp. 53–76.

    Article  MathSciNet  Google Scholar 

  8. Lee, C.-G. and Ma, Z., The Generalized Quadratic Assignment Problem, Tech. Rep. Univ. Toronto, Toronto, Canada: Department of Mechanical and Industrial Engineering, 2004.

    Google Scholar 

  9. Sahni, S. and Gonzalez, T., P-complete approximation problems, J. of ACM, 1976, vol. 23, pp. 555–565.

    Article  MATH  MathSciNet  Google Scholar 

  10. Burkard, R.E., Locations with spatial interactions: the quadratic assignment problem, in Discrete Location Theory, Mirchandani, P.B. and Francis, R.L., Eds., New York: Wiley, Ser. Discrete Math. Optim., 1990, pp. 387–437.

    Google Scholar 

  11. Rendl, F., Pardalos, P. and Wolkowicz, H., Proc DIMACS Workshop on Quadratic Assignment Problems, Am. Mathem. Soc., 1994, vol. 16, pp. 1–42.

    MathSciNet  Google Scholar 

  12. Burkard, R.E. and Cela, E., Quadratic and three-dimensional assignment problems, in Annotated Bibliographies in Combinatorial Optimization, Dell’Amico, M., Maffioli, F., and Martello, S., Eds., Chichester: Wiley, 1997, pp. 373–392.

    Google Scholar 

  13. Holland, J.H., Adaptation in Natural and Artificial Systems, Cambridge: Mass. Inst. Technol., 1992.

    Google Scholar 

  14. Kirkpatrick, S., Gelatt, C.D., and Vecchi, M.P., Optimization by simulated annealing, Science. New Ser., 1983, vol. 220, pp. 671–680.

    MATH  MathSciNet  Google Scholar 

  15. Glover, F., Future paths for integer programming and links to artificial intelligence, Compt. Oper. Res., 1986, vol. 13, pp. 533–549.

    Article  MATH  MathSciNet  Google Scholar 

  16. Elmore, A., Das, S., Agrawal, D., and El Abbadi, A., Zephyr: live migration in shared nothing databases for elastic cloud platforms, Proc. Int. Conf. on Management of Data, New York, 2011, pp. 301–312.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Demidov Yaroslavl State University, Yaroslavl, Russia

    E. A. Boytsov

Authors
  1. E. A. Boytsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. A. Boytsov.

Additional information

The article is published in the original.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Boytsov, E.A. Applying stochastic metaheuristics to the problem of data management in a multi-tenant database cluster. Aut. Control Comp. Sci. 48, 594–601 (2014). https://doi.org/10.3103/S0146411614070190

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411614070190

Keywords

Search

Navigation