Manipulating sets of hierarchical data

A method of merging at least a first complex two dimensional graphical hierarchy and a second complex two dimensional graphical hierarchy to yield a third complex two dimensional graphical hierarchy, the first, second, and third complex two dimensional graphical hierarchies being in the form of a labeled tree hierarchy that includes content originating from one or more databases, the method comprising:

• accessing instructions from one or more physical memory devices for execution by one or more processors;
• executing instructions accessed from the one or more physical devices by the one or more processors;
• storing, in at least one of the physical memory devices, binary digital signal values resulting from having executed the instructions on the one or more processors;
• wherein the accessed instructions are executable to merge complex two dimensional graphical hierarchies;
• and
• wherein executing the complex hierarchy merger instructions further comprising:
• accessing from the one or more physical memory devices, a first symbol value corresponding to the first complex two dimensional graphical hierarchy and a second symbol value corresponding to the second complex two dimensional graphical hierarchy, the first and second symbol values based, at least in part, on a stored association between symbol values and labeled tree hierarchies, wherein the complex two dimensional graphical hierarchies to be merged have a corresponding unique symbol value;
• combining the first symbol value and the second symbol value to yield a third symbol value;
• and
• forming the third complex two dimensional graphical hierarchy based, at least in part on the first and second complex two dimensional graphical hierarchies.

An apparatus to merge at least a first complex two dimensional graphical hierarchy and a second complex two dimensional graphical hierarchy to yield a third complex two dimensional graphical hierarchy, the first, second, and third complex two dimensional graphical hierarchies to be in the form of a labeled tree hierarchy that is to include content originating from one or more databases, the apparatus comprising:

• one or more processors coupled to one or more physical memory devices to store executable instructions and to store binary digital signal quantities as physical memory states, wherein the executable instructions being accessible from one or more physical memory devices for execution by the one or more processors;
• the one or more processors able to store in at least one of the physical memory devices, binary digital signal quantities, if any, that are to result from execution of the instructions on the one or more processors, wherein the accessed instructions are to be executable to merge complex two dimensional graphical hierarchies:
• and
• wherein the complex hierarchy merger instructions further to:
• access from the one or more physical memory devices, a first symbol value to correspond to the first complex two dimensional graphical hierarchy and a second symbol value to correspond to the second complex two dimensional graphical hierarchy, the first and second symbol values to be based, at least in part, on a stored association between the symbol values and labeled tree hierarchies, wherein the complex two dimensional graphical hierarchies to be merged to have a corresponding unique symbol value;
• combine the first symbol value and the second symbol value to yield a third symbol value;
• and
• form the third complex two dimensional graphical hierarchy based, at least in part, on the first and second complex two dimensional graphical hierarchies.

An article comprising:

• a non-transitory storage medium comprising instructions stored thereon, the instructions to be executable to merge at least a first complex two dimensional graphical hierarchy and a second complex two dimensional graphical hierarchy to yield a third complex two dimensional graphical hierarchy, the first, second, and third complex two dimensional graphical hierarchies to be in the form of a labeled tree hierarchy that is to include content originating from one or more databases;
• wherein the instructions to be accessible from the non-transitory storage medium and to be stored as physical memory states on one or more physical memory devices, the one or more physical memory devices coupled to one or more processors able to execute the instructions to be stored as physical memory states, the one or more physical memory devices also to be able to store binary digital signal quantities, if any, as physical memory states, that are to result from execution of the instructions on the one or more processors;
• and
• wherein the executable complex hierarchy merger instructions further to:
• access from the one or more physical memory devices, a first symbol value to correspond to the first complex two dimensional graphical hierarchy and a second symbol value to correspond to the second complex two dimensional graphical hierarchy, the first and second symbol values to be based, at least in part, on a stored association between symbol values and labeled tree hierarchies, wherein the complex two dimensional graphical hierarchies to be merged to have a corresponding unique symbol value:
• combine the first symbol value and the second symbol value to yield a third symbol value;
• and
• form the third complex two dimensional graphical hierarchy based, at least in part on, the first and second complex two dimensional graphical hierarchies.