Research Article
Dynamic Pricing for Resource Consumption in Cloud Service
Input: Interval . | Output: B++-tree after inserting . | (1) Start from the root node | (2) for each interval in . do | (3) if interval intersects with | (4) if is the leaf node | (5) Set the common interval of and as the new | interval, add of and of to the new | interval | (6) else | (7) search into the child node of , insert to | , back to step (2). | (8) end if | (9) end if | (10) end for |
|