Patent ID: 11416473

Abstract:
Example embodiments facilitate creation of efficient tree structures (and strategic modification of and manipulation of existing tree structures), such that the resulting tree structures enable rapid computing operations, including, but not limited to, rapid relational set operations (e.g., joining trees, comparing tree structures, determining structural similarities of trees, adding tree nodes, removing or replacing tree nodes, accessing tree data, updating tree data, and so on). An example method relates to a method and/or system for creating and manipulating tree data structures (also simply called trees herein) as, for example, in relational databases. One embodiment uses compact bit-wise path encoding that stores structural data related to tree branches to which a current node belongs. The embodiment facilitates manipulating a representation of a tree and includes traversing at least a portion of the tree from a starting node, and then for each traversed node, modifying node metadata depending on whether or not the traversed node is a sibling node or a child node.