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 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, 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 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, binary digital signal values comprising content for one or more databases, or a portion thereof;   wherein the accessed instructions are executable to merge complex two dimensional graphical hierarchies; and   wherein the executing the complex hierarchy merger instructions further comprising:
 accessing from the one or more physical memory devices, a first symbol value corresponding to content from the one or more databases, or a portion thereof, to be included in the first complex two dimensional graphical hierarchy and a second symbol value corresponding to a portion of the second complex two dimensional graphical hierarchy; 
 combining the first symbol value and the second symbol value; and 
 forming the third complex two dimensional graphical hierarchy, or at least a portion thereof, based, at least in part on the combining the first symbol value and the second symbol value. 
   
     
     
         475 . The method of  claim 474 , wherein the first and second symbol values comprise first and second alphanumerical symbol values, stored in the form of binary digital signal values. 
     
     
         476 . The method of  claim 474  wherein the executing the complex hierarchy merger instructions further comprises displaying the third complex two dimensional graphical hierarchy. 
     
     
         477 . The method of  claim 474 , wherein the executing the complex hierarchy merger instructions further comprises storing the third complex two dimensional graphical hierarchy. 
     
     
         478 . The method of  claim 474 , wherein the first and the second complex two dimensional graphical hierarchies comprise complex two dimensional hierarchies in the form of edge or node labeled trees. 
     
     
         479 . The method of  claim 477 , wherein the first and/or second symbol values are based, at least in part, on a stored association between symbol values and labeled tree hierarchies. 
     
     
         480 . The method of  claim 479 , wherein the stored association is implemented via a stored look up table. 
     
     
         481 . The method of  claim 474 , wherein the one or more databases, or a portion thereof, comprises a relational database. 
     
     
         482 . An apparatus to yield a third complex two dimensional graphical hierarchy based at least in part on a merger of a first complex two dimensional graphical hierarchy and a second complex two dimensional graphical hierarchy, at least one of the first, second, or third complex two dimensional graphical hierarchies to be in the form of a labeled tree hierarchy that is to include content 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, and the binary digital signal values comprising content for one or more databases, or a portion thereof, 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 corresponding to content from the one or more databases, or a portion thereof, to be included in the first complex two dimensional graphical hierarchy and a second symbol value corresponding to at least a portion of the second complex two dimensional graphical hierarchy; 
 combine the first symbol value and the second symbol value; and 
 form the third complex two dimensional graphical hierarchy, or at least a portion thereof, based, at least in part, on the combination the first symbol value and the second symbol value. 
   
     
     
         483 . The apparatus of  claim 482 , wherein the symbol values to comprise first and second alphanumerical symbol values to be stored in the form of binary digital signal values. 
     
     
         484 . The apparatus of  claim 482 , wherein the complex hierarchy merger instructions further comprise instructions to display the third complex two dimensional graphical hierarchy. 
     
     
         485 . The apparatus of  claim 482 , wherein the complex hierarchy merger instructions further comprise instructions to store the third complex two dimensional graphical hierarchy. 
     
     
         486 . The apparatus of  claim 482 , wherein the first and the second complex two dimensional graphical hierarchies further to comprise complex two dimensional graphical hierarchies in the form of edge or node labeled trees. 
     
     
         487 . The apparatus of  claim 485 , wherein the first and/or second symbol values are to be based, at least in part, on a stored association between symbol values and labeled tree hierarchies. 
     
     
         488 . The apparatus of  claim 487 , wherein the stored association is to be implemented via a stored look up table. 
     
     
         489 . The apparatus of  claim 482 , wherein the one or more databases, or a portion thereof, to comprise a relational database. 
     
     
         490 . An article comprising:
 a non-transitory storage medium comprising instructions stored thereon, the instructions to be executable to yield a third complex two dimensional graphical hierarchy based at least in part on a merger of a first complex two dimensional graphical hierarchy and a second complex two dimensional graphical hierarchy, at least one of 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 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 to be 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 binary digital signal values to comprise content for one or more databases; and   wherein the executable complex hierarchy merger instructions further to:   access, from the one or more physical memory devices, a first symbol value corresponding to content from the one or more databases, or a portion thereof, to be included in the first complex two dimensional graphical hierarchy and a second symbol value corresponding to at least a portion of the second complex two dimensional graphical hierarchy;   combine the first symbol value and the second symbol value; and   form the third complex two dimensional graphical hierarchy, or at least a portion thereof, based at least in part, on the combination of the first symbol value and the second symbol value.   
     
     
         491 . The article of  claim 490 , wherein the first and second symbol values to comprise first and second alphanumerical symbol values, stored in the form of binary digital signal values. 
     
     
         492 . The article of  claim 490 , wherein the complex hierarchy merger instructions further to display the third complex two dimensional graphical hierarchy symbol values. 
     
     
         493 . The article of  claim 490 , wherein the complex hierarchy merger instructions further to store the third complex two dimensional graphical hierarchy. 
     
     
         494 . The article of  claim 490 , wherein the first and the second complex two dimensional graphical hierarchies to comprise complex two dimensional hierarchies in the form of edge or node labeled trees. 
     
     
         495 . The article of  claim 493 , wherein the first and second symbol values are to be based, at least in part, on a stored association between symbol values and labeled tree hierarchies. 
     
     
         496 . The article of  claim 495 , wherein the stored association is to be implemented via a stored look up table. 
     
     
         497 . The article of  claim 490 , wherein the one or more databases, or a portion thereof, to comprise a relational database.