Comparison of Data Management Strategies for Multi-Tenant Database Cluster

Evgeny Boytsov, Valery Sokolov

Abstract

This paper discusses the problem of tenant data distribution in a multi-tenant database cluster - the concept of reliable and easy to use data storage for high load cloud applications with thousands of customers, based on ordinary relational database servers. The formal statements of the problem for cases with and without data replication are given and a metric for evaluating the quality of data distribution is proposed. The proposed metric is compared with ad-hoc data management strategies using an experiment at the imitation model of the multi-tenant database cluster and the result of the experiment is provided and summarized.

References

  1. Beckman, M. and Koopmans, T. (1957). Assignment problems and the location of economic activities. Econometrica, 25:53-76.
  2. Boytsov, E. (2013). Designing and development of the imitation model of a multi-tenant database cluster. Modeling and analysis of information systems, 20.
  3. Burkard, R. (1990). Locations with spatial interactions: The quadratic assignment problem. Discrete location theory, pages 387-437.
  4. Burkard, R. and Cela, E. (1997). Quadratic and threedimensional assignment problems. pages 373-392.
  5. Candan, K., Li, W., Phan, T., and Zhou, M. (2009). Frontiers in information and software as services. In Proceedings of ICDE, pages 1761-1768.
  6. Chong, F. and G., C. (2006). Architecture strategies for catching the long tail.
  7. Elmore, A., Das, S., Agrawal, D., and El Abbadi, A. (2011). Zephyr: Live migration in shared nothing databases for elastic cloud platforms. In SIGMOD Conference.
  8. Lang, W., Shankar, S., Patel, J., and Kalhan, A. (2012). Towards multi-tenant performance slos. In ICDE.
  9. Lee, C.-G. and Ma, Z. (2004). The generalized quadratic assignment problem. Technical report, University of Toronto, Department of Mechanical and Industrial Engineering, Toronto, Canada.
  10. Rendl, F., Pardalos, P., and Wolkowicz, H. (1994). The quadratic assignment problem: A survey and recent developments. In Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, volume 16, pages 1-42. American Mathematical Society.
  11. Sahni, S. and Gonzalez, T. (1976). P-complete approximation problems. Journal of ACM, 23(3):555-565.
  12. Schaffner, J., Januschowski, T., Kercher, M., Kraska, T., Plattner, H., Franklin, M., and Jacobs, D. (2013). Rtp: Robust tenant placement for elastic in-memory database clusters. In SIGMOD Conference.
  13. Yang, F., Shanmugasundaram, J., and Yerneni, R. (2008). A scalable data platform for a large number of small applications. Technical report, Yahoo! Research.
Download


Paper Citation


in Harvard Style

Boytsov E. and Sokolov V. (2014). Comparison of Data Management Strategies for Multi-Tenant Database Cluster . In Proceedings of the Fourth International Symposium on Business Modeling and Software Design - Volume 1: BMSD, ISBN 978-989-758-032-1, pages 217-222. DOI: 10.5220/0005426302170222


in Bibtex Style

@conference{bmsd14,
author={Evgeny Boytsov and Valery Sokolov},
title={Comparison of Data Management Strategies for Multi-Tenant Database Cluster},
booktitle={Proceedings of the Fourth International Symposium on Business Modeling and Software Design - Volume 1: BMSD,},
year={2014},
pages={217-222},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005426302170222},
isbn={978-989-758-032-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Fourth International Symposium on Business Modeling and Software Design - Volume 1: BMSD,
TI - Comparison of Data Management Strategies for Multi-Tenant Database Cluster
SN - 978-989-758-032-1
AU - Boytsov E.
AU - Sokolov V.
PY - 2014
SP - 217
EP - 222
DO - 10.5220/0005426302170222