Dynamic Pricing for Resource Consumption in Cloud Service

Algorithm 2

Split operation.

Input: Node which is overflowed;

Output: Node and which are split from .

(1)   create new node and

(2)   retains the first half intervals of the original node

  ; retains the rest of intervals

(3)   if is the interior node

(4) retains the first half pointers, retains the

  rest of pointers

(5)   if is the leaf node

(6) retains the first values, retains the rest values

(7)   if is the root node

(8)   create a new root node , make it be the

  parent node of and . Make be the new

  root node

(9)   else if is not the root node

(10)   suppose is the parent node of , make

be the parent of and

(11)   end if

(12)   If is overflowed

(13)   Split

(14)   end if

(15)   end

(16) end