Patent ID: 8818974

Claim:
A non-transitory computer-readable medium including programming for execution by a processor, the programming, when executed by the processor, implementing a method, comprising: listening for a transaction, having a start boundary and an end boundary, on a hierarchy table; and upon detecting and identifying the transaction, directing execution of an update method on a bridge table, wherein the update method is completed within the boundaries of the transaction using the identity of the transaction and a state of the bridge table at the start boundary of the transaction, wherein the transaction is a move node transaction in which a node X is updated with a new parent node Y, and wherein the update method comprises: finding a set S 1 of rows from the bridge table wherein a child node ID is X and a parent node ID is not the same as the child node ID; finding a set S 2 of rows from the bridge table wherein the parent node ID is X; computing a Cartesian product S 3 =S 1 ×S 2 ; deleting one or more rows listed in S 3 from the bridge table; finding a set S 4 of rows from the bridge table wherein the child node ID is Y; computing a Cartesian product S 5 =S 4 ×S 2 ; and inserting one or more rows listed in S 5 into the bridge table.