Tenant placement in multitenant databases for profit maximization

1. A method for database consolidation, comprising:

generating a model for expected penalty estimation;

determining a tenant's value as a function of query arrival rate and Service Legal Agreement SLA penalty;

placing a tenant to minimize a total expected cost in the order of the tenant value; and

progressively using additional servers to prevent any server from being saturated to guarantee a tenant placement that costs no more than four times the cost of any other placement.

2. The method of claim 1 , comprising consolidating multiple database tenants into a single server.

3. The method of claim 1 , comprising checking if placing the tenant on an existing server makes the server sequentially splittable.

4. The method of claim 1 , comprising checking if placing the tenant on a new server reduces cost relative to placing the tenant on an existing server.

5. The method of claim 1 , comprising placing a tenant with uniform query processing time and SLA penalty across tenants with an approximation ratio over standard placement of 3.

6. The method of claim 1 , comprising placing a tenant without considering SLA penalty (general case) with an approximation ratio over standard placement of 4.

7. The method of claim 1 , comprising coupling dynamic programming with an approximation placement of tenant for improved quality and low cost.

8. The method of claim 1 , comprising for SLA profit-aware decisions for both tenant placement and capacity planning.

9. The method of claim 1 , comprising maximizing

Profit

=

∑

i

⁢

⁢

r

i

-

OpCost

where r i is the revenue generated by a query i, while OpCost is the operational cost.

10. The method of claim 9 , comprising a recurrence relation:

MP

⁡

(

i

,

j

)

=

{

C

⁡

(

1

,

i

)

j

=

1

min

k

⁢

(

MP

⁡

(

k

-

1

,

j

-

1

)

+

C

⁡

(

k

,

i

)

)

,

j

>

1

where C(i,j) is an expected SLA penalty when co-locating tenants t i through t j within a single server.