Manipulating sets of hierarchical data

Abstract

Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

1 - 473 . (canceled) 
     
     
         474 . A method of manipulating 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, at least one of the first, the second, or the 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 form complex two dimensional graphical hierarchies; and   wherein the executing the complex hierarchy manipulation 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 first and the second complex two dimensional graphical hierarchies have a corresponding unique symbol value; 
 forming the third complex two dimensional graphical hierarchy based, at least in part on the first and second complex two dimensional graphical hierarchies; and 
 generating a third symbol value corresponding to the third complex two dimensional graphical hierarchy based at least in part on: the first and second symbol values and the stored associated between symbol values and labeled tree hierarchies. 
   
     
     
         475 . The method of  claim 474 , wherein the symbol values comprise alphanumerical symbol values, stored in the form of binary digital signal values. 
     
     
         476 . The method of  claim 475 , wherein the symbol values comprise numerical symbol values, stored in the form of binary digital signal values. 
     
     
         477 . The method of  claim 476 , wherein the first and the second numerical symbol values comprise binary symbol values. 
     
     
         478 . The method of  claim 475 , wherein the first and the second alphanumerical symbol values are converted to binary symbol values. 
     
     
         479 . The method of  claim 474 , wherein the forming the third complex two dimensional graphical hierarchy based, at least in part, on the first and second complex two dimensional graphical hierarchies comprises merging the first and second complex two dimensional graphical hierarchies. 
     
     
         480 . The method of  claim 479 , wherein the merging the first and second complex two dimensional graphical hierarchies comprises converting the first and the second complex two dimensional graphical hierarchies to complex two dimensional hierarchies in the form of edge or node labeled trees. 
     
     
         481 . The method of  claim 474 , wherein at least one of the first and the second complex two dimensional graphical hierarchies includes at least one null symbol value. 
     
     
         482 . The method of  claim 481 , wherein the forming the third complex two dimensional graphical hierarchy based, at least in part on the first and second complex two dimensional graphical hierarchies further comprises converting the at least one of the first and the second complex two dimensional graphical hierarchies that includes at least one null symbol value to a complex two dimensional graphical hierarchy without a null symbol value. 
     
     
         483 . The method of  claim 482 , wherein the forming the third complex two dimensional graphical hierarchy based, at least in part on the first and second complex two dimensional graphical hierarchies further comprises converting both the first and the second complex two dimensional hierarchies, without the null symbol value, to complex two dimensional hierarchies in the form of edge labeled trees. 
     
     
         484 . The method of  claim 474 , wherein the first and the second complex two dimensional graphical hierarchies are in the form of edge or node labeled trees. 
     
     
         485 . The method of  claim 474 , wherein the stored association is stored in memory as a look up table. 
     
     
         486 . An apparatus to form a third complex two dimensional graphical hierarchy based at least in part on a first complex two dimensional graphical hierarchy and a second 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 form complex two dimensional graphical hierarchies: and   wherein the complex hierarchy forming instructions further to:
 access, 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 to be based, at least in part, on a stored association between symbol values and labeled tree hierarchies, wherein the first and the second complex two dimensional graphical hierarchies to have a corresponding unique symbol value; 
   form the third complex two dimensional graphical hierarchy based, at least in part, on the first and second complex two dimensional graphical hierarchies; and   generate a third symbol value corresponding to the third complex two dimensional graphical hierarchy, to be based at least in part, on: the first and second symbol values and the stored associated between symbol values and labeled tree hierarchies.   
     
     
         487 . The apparatus of  claim 486 , wherein the symbol values to comprise alphanumerical symbol values to be stored in the form of binary digital signal values. 
     
     
         488 . The apparatus of  claim 487 , wherein the symbol values to comprise numerical symbol values to be stored in the form of binary digital signal values. 
     
     
         489 . The apparatus of  claim 488 , wherein the first and the second numerical symbol values to comprise binary symbol values. 
     
     
         490 . The apparatus of  claim 487 , wherein the complex hierarchy forming instructions further to convert the first and the second alphanumerical symbol values to binary symbol values. 
     
     
         491 . The apparatus of  claim 486 , wherein to form the third complex two dimensional graphical hierarchy based, at least in part, on the first and second complex two dimensional graphical hierarchies comprises to merge the first and second complex two dimensional graphical hierarchies. 
     
     
         492 . The apparatus of  claim 491 , wherein to merge the first and second complex two dimensional graphical hierarchies also comprises to convert the first and the second complex two dimensional graphical hierarchies to complex two dimensional hierarchies in the form of edge or node labeled trees. 
     
     
         493 . The apparatus of  claim 486 , wherein at least one of the first and the second complex two dimensional graphical hierarchies to include at least one null symbol value; and 
       wherein to form the third complex two dimensional graphical hierarchy based, at least in part on the first and the second complex two dimensional graphical hierarchies further comprises to convert the at least one of the first and the second complex two dimensional graphical hierarchies that includes at least one null symbol value to a complex two dimensional graphical hierarchy without a null symbol value. 
     
     
         494 . The apparatus of  claim 493 , wherein to form the third complex two dimensional graphical hierarchy is based, at least in part on the first and second complex two dimensional graphical hierarchies further comprises to convert both the first and the second complex two dimensional graphical hierarchies, without the null symbol value, to complex two dimensional graphical hierarchies in the form of edge labeled trees. 
     
     
         495 . The apparatus of  claim 486 , wherein the first and the second complex two dimensional graphical hierarchies are to be in the form or edge or node labeled trees. 
     
     
         496 . The apparatus of  claim 486 , wherein the stored association is to be stored in memory as a look up table. 
     
     
         497 . An article comprising:
 a non-transitory storage medium comprising instructions stored thereon, the instructions to be executable to form a third complex two dimensional graphical hierarchy based at least in part on a first complex two dimensional graphical hierarchy and a second 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 are accessible from the non-transitory storage medium and 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 stored as physical memory states, the one or more physical memory devices also 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 forming instructions further to:   access, 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 first and the second complex two dimensional graphical hierarchies have a corresponding unique symbol value;   form the third complex two dimensional graphical hierarchy based, at least in part on the first and second complex two dimensional graphical hierarchies; and   generate a third symbol value corresponding to the third complex two dimensional graphical hierarchy based at least in part on: the first and second symbol values and the stored associated between symbol values and labeled tree hierarchies.   
     
     
         498 . The article of  claim 497 , wherein the symbol values to comprise alphanumerical symbol values, to be stored in the form of binary digital signal values. 
     
     
         499 . The article of  claim 498 , wherein the symbol values to comprise numerical symbol values, to be stored in the form of binary digital signal values. 
     
     
         500 . The article of  claim 499 , wherein the first and the second numerical symbol values to comprise binary symbol values. 
     
     
         501 . The article of  claim 498 , wherein the complex hierarchy forming instructions further to convert the first and the second alphanumerical symbol values to binary symbol values. 
     
     
         502 . The article of  claim 497 , wherein to form the third complex two dimensional graphical hierarchy based, at least in part, on the first and second complex two dimensional graphical hierarchies comprises to merge the first and second complex two dimensional graphical hierarchies. 
     
     
         503 . The article of  claim 502 , wherein to merge the first and second complex two dimensional graphical hierarchies comprises to convert the first and the second complex two dimensional graphical hierarchies to complex two dimensional hierarchies in the form of edge or node labeled trees. 
     
     
         504 . The article of  claim 497 , wherein at least one of the first and the second complex two dimensional graphical hierarchies to include at least one null symbol value; and
 wherein to form the third complex two dimensional graphical hierarchy is based, at least in part on the first and the second complex two dimensional graphical hierarchies further to comprise to convert the at least one of the first and the second complex two dimensional graphical hierarchies that includes at least one null symbol value to a complex two dimensional graphical hierarchy without a null symbol value.   
     
     
         505 . The article of  claim 504 , wherein to form the third complex two dimensional graphical hierarchy is based, at least in part on the first and second complex two dimensional graphical hierarchies further comprises to convert both the first and the second complex two dimensional graphical hierarchies, without the null symbol value, to complex two dimensional graphical hierarchies in the form of edge labeled trees. 
     
     
         506 . The article of  claim 497 , wherein the first and the second complex two dimensional graphical hierarchies are in the form or edge or node labeled trees. 
     
     
         507 . The article of  claim 497 , wherein the stored association is to be stored in memory as a look up table.