Patent ID: 9529836
Filing Date: 2016-12-27
CPC Classification: G06F,G06T,H04L

Claim Text:
1. A computer-implemented method comprising: determining that a disjoint-or tree occupies more memory than a maximum memory limit, wherein the disjoint-or tree satisfies two properties: a first property that each element of the disjoint-or tree is associated with a set of dependencies that is a union of one or more sets of dependencies associated with the element and any descendant elements of the element of the disjoint-or tree, and a second property that children elements of each parent element of the disjoint-or tree are associated with disjoint sets of dependencies; in response to determining that the disjoint-or tree occupies more memory than the maximum memory limit, selecting one or more elements of the disjoint-or tree for removal; determining that a particular leaf element of the one or more elements of the disjoint-or tree selected for removal has a parent element with a status indicator of complete; in response to determining that the particular leaf element of the one or more elements of the disjoint-or tree selected for removal has a parent element with a status indicator of complete, adding data of the particular leaf element of the one or more elements of the disjoint-or tree to a compound leaf element, wherein the compound leaf element is a child element of the parent element with the status indicator of complete and includes data associated with the particular leaf element of the one or more elements of the disjoint-or tree and one or more other sibling leaf elements of the one or more elements of the disjoint-or tree; and removing the particular leaf element of the one or more elements from the disjoint-or tree without propagating changes associated with removing the particular leaf element of the one or more elements from the disjoint-or tree to all ancestors of the particular leaf element of the one or more elements of the disjoint-or tree.