Patent ID: 7640259
Filing Date: 2009-12-29
Classification: G06F,Y10S

Abstract:
1. A computer-implemented method for inserting a new node into a tree structure, the method comprising steps performed by a computer of: storing the tree structure in at least one database table within a database system, wherein the database system is associated with a memory, wherein the tree structure comprises at least one parent node having space, and at least one child node; wherein the database table contains an entry for each node in the tree structure, and wherein said each node is associated with a plurality of fields stored in the memory, wherein the fields comprise an identification, a left value, a right value, a width, and a tree node interval; wherein each child node comprises a pointer to the associated parent node of the child node; wherein the tree node interval comprises a range between the left value and the right value of the new node; and wherein the new node is a child node having a child node identification corresponding to the identification of the parent node, determining the identification of the parent node of the new node; determining the width of the new node; determining whether a gap exists in the tree structure for a parent node having the determined parent node identification, wherein the determining whether the gap exists comprises: updating the table in the database system to reflect the new child node. wherein the table comprises information in the tree structure.