A Heuristic Data Allocation Method for Multi-tenant SaaS Application in Distributed Database Systems

Multi-tenant Software as a Service (aka, SaaS) applications generally run on distributed database systems for better performance and scalability. How to partition and allocate data of the application on distributed database servers is important to the efficiency of the whole system. This paper proposes a tenant data set based data partitioning method. And based on the characteristics of the data operations of each tenant, this paper put forward a heuristic data allocation method to achieve minimum data operation cost of all the tenants of the SaaS application. Experimental results show that the proposed data allocation method reduces data operation cost, thus improves the execution efficiency of the application.

[1]  Bo Gao,et al.  A Study and Performance Evaluation of the Multi-Tenant Data Tier Design Patterns for Service Oriented Computing , 2008, 2008 IEEE International Conference on e-Business Engineering.

[2]  S. Moyer,et al.  The impact of network convergence on telecommunications software , 2001, IEEE Commun. Mag..

[3]  J. Hartmanis Computers and Intractability: A Guide to the Theory of NP-Completeness (Michael R. Garey and David S. Johnson) , 1982 .

[4]  Jeffrey M. Voas,et al.  What's in a Name? Distinguishing between SaaS and SOA , 2008, IT Professional.

[5]  K. Humenik,et al.  Optimal allocation for partially replicated database systems on tree-based networks , 1992, Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings].

[6]  Jun Sawamoto,et al.  Virtual Database Technology for Distributed Database , 2010, 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops.

[7]  Bharat K. Bhargava,et al.  Global Scheduling for Flexible Transactions in Heterogeneous Distributed Database Systems , 2001, IEEE Trans. Knowl. Data Eng..

[8]  Calin Cenan,et al.  Distributed database replication - a game theory? , 2005, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05).

[9]  Gong An Research of Query Optimization Based on Genetic Algorithm in Distributed Database , 2009 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .