Patent ID: 8203972

Claim:
A non-transitory machine-readable medium storing instructions adapted to be executed by a computer to perform a method for compressing a tree, the method comprising: a. setting a current node pointing to a root node of the tree; b. if a rule associates with the node identifier of the current node, applying the rule; c. if a node is to be deleted by applying the rule: deleting the node from the tree; storing the node identifier of the deleted node; and storing a parameter associated with the stored node identifier, the parameter representing a cumulative number for of nodes currently having been deleted from the tree; d. if the parent node identifier of the current node has previously been stored: setting the node identifier of the current node in the tree to a first new value, the first new value being a difference of an original value of the node identifier of the current node and a total number of nodes having been currently deleted from the tree; and setting the parent node identifier of the current node in the tree to a second new value, the second new value being a difference of an original parent node identifier and a parameter associated with the original parent node identifier; and e. if there is a next node in the tree, setting the current node to the next node in the tree.