Top-nodes algorithm

The calendar is stored as a binary tree where leaves represent elementary time periods. Other nodes represent the period of time covered by all their descendants. The period of time covered by a reservation is represented by a set of "top-nodes". This set is the minimal set of nodes that exactly cover the reservation period of time. A node of the binary tree is a "top-node" for a given reservation if • all its descendants are inside the reservation period of time, and • it is the root node, or at least one descendant of the parent node is outside of the reservation period of time. The following value is stored in each node: q(node) = max(q(left child), q(right child)) + total amount of reserved resource for all reservations having this node as a "top-node" (for code optimization, the two parts of this sum are usually stored separately.) ==Performance==

The advantage of this algorithm is that the time to register a new resource reservation depends only on the calendar size (it does not depend on the total number of reservations). Let be the number of elementary periods in the calendar. The maximal number of "top-nodes" for a given reservation is 2.log n. • to check if an amount of resource is available during a specific period of time : O(log n) • to reserve an amount of resource for a specific period of time : O(log n) • to delete a previous reservation : O(log n) • to move the calendar forward : O(log n + M.log n) where is the number of reservations that are active during the added calendar periods. ( = 0 if reservations are not allowed after the end of the calendar.) ==References==