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, or a portion thereof, and a second complex two dimensional graphical hierarchy, or a portion thereof, to yield a third complex two dimensional graphical hierarchy, or a portion thereof, the first, second and/or third complex two dimensional graphical hierarchies, or the portions thereof, respectively include 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;   wherein the executed instructions merge complex two dimensional graphical hierarchies, or the portions thereof;   wherein executing the complex two dimensional graphical hierarchy merger instructions comprises:
 accessing from the one or more physical memory devices, one or more first symbol values corresponding to the first complex two dimensional graphical hierarchy, or the portion thereof, and one or more second symbol value corresponding to the second complex two dimensional graphical hierarchy, or the portion thereof; and 
 forming the third complex two dimensional graphical hierarchy, or the portion thereof, based, at least in part, on the one or more first symbol values and the one or more second symbol values. 
   
     
     
         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 474 , wherein the executing the complex two dimensional graphical hierarchy merger instructions comprises displaying the third complex two dimensional graphical hierarchy, or the portion thereof. 
     
     
         477 . The method of  claim 474 , wherein the symbol values comprise numerical symbol values stored in the form of binary digital signal values. 
     
     
         478 . The method of  claim 474 , wherein at least one of the first and/or the second complex two dimensional graphical hierarchies, or the portions thereof, are in the form of one or more edge and/or node labeled trees, or portions thereof. 
     
     
         479 . The method of  claim 474 , wherein the executing the complex two dimensional graphical hierarchy merger instructions comprises converting at least one of the first and/or the second complex two dimensional graphical hierarchies, or the portions thereof, to one or more complex two dimensional hierarchies in the form of one or more edge and/or node labeled trees, or portions thereof. 
     
     
         480 . The method of  claim 475 , wherein at least one of the first and/or the second complex two dimensional graphical hierarchies, or the portions thereof, includes at least one null symbol value. 
     
     
         481 . The method of  claim 480 , wherein the executing the complex two dimensional graphical hierarchy merger instructions comprises converting the at least one of the first and/or the second complex two dimensional graphical hierarchies, or the portions thereof, that includes at least one null symbol value to a complex two dimensional graphical hierarchy, or a portion thereof, without a null symbol value. 
     
     
         482 . The method of  claim 481 , wherein the executing the complex two dimensional graphical hierarchy merger instructions comprises converting the at least one of the first and/or the second complex two dimensional hierarchies, or the portions thereof, without the null symbol value to one or more complex two dimensional hierarchies in the form of one or more edge labeled trees, or portions thereof. 
     
     
         483 . The method of  claim 481 , wherein the executing the complex two dimensional graphical hierarchy merger instructions comprises converting the at least one of the first and/or the second complex two dimensional hierarchies, or the portions thereof, without the null symbol value to complex one or more two dimensional hierarchies in the form of one or more node labeled trees, or portions thereof. 
     
     
         484 . The method of  claim 475 , wherein the alphanumerical symbol values comprise numerical symbol values. 
     
     
         485 . The method of  claim 475 , wherein the alphanumerical symbol values comprise alphabetic symbol values. 
     
     
         486 . The method of  claim 474 , wherein the one or more first symbol values corresponding to the first complex two dimensional graphical hierarchy, or the portion thereof, and the one or more second symbol values corresponding to the second complex two dimensional graphical hierarchy, or the portion thereof, are stored in memory via a look up table. 
     
     
         487 . An apparatus to merge at least a first complex two dimensional graphical hierarchy, or a portion thereof, and a second complex two dimensional graphical hierarchy, or a portion thereof, to yield a third complex two dimensional graphical hierarchy, or a portion thereof, the first, second and/or third complex two dimensional graphical hierarchies, or the portions thereof, are to respectively include content from one or more databases, the apparatus comprising:
 one or more processors coupled to one or more physical memory devices that are to store executable instructions and are to store binary digital signal quantities, as physical memory states, wherein the executable instructions are accessible from one or more physical memory devices for execution by the one or more processors;   the one or more processors are 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 executable to merge complex two dimensional graphical hierarchies:   wherein the complex two dimensional graphical hierarchy merger instructions are executable to:
 access from the one or more physical memory devices, one or more first symbol values that is to correspond to the first complex two dimensional graphical hierarchy, or the portion thereof, and one or more second symbol values that is to correspond to the second complex two dimensional graphical hierarchy, or the portion thereof; and 
 form the third complex two dimensional graphical hierarchy, or the portion thereof, based, at least in part, on the one or more first symbol values and the one or more second symbol values. 
   
     
     
         488 . The apparatus of  claim 487 , wherein the symbol values are to comprise alphanumerical symbol values stored in the form of binary digital signal values. 
     
     
         489 . The apparatus of  claim 487 , wherein the complex two dimensional graphical hierarchy merger instructions are executable by the one or more processors to display the third complex two dimensional graphical hierarchy, or the portion thereof. 
     
     
         490 . The apparatus of  claim 487 , wherein the symbol values are to comprise numerical symbol values stored in the form of binary digital signal values. 
     
     
         491 . The apparatus of  claim 487 , wherein at least one of the first and/or the second complex two dimensional graphical hierarchies, or the portions thereof, are to be in the form of one or more edge and/or node labeled trees, or portions thereof. 
     
     
         492 . The apparatus of  claim 487 , wherein the complex two dimensional graphical hierarchy merger instructions are executable by the one or more processors to convert at least one of the first and/or the second complex two dimensional graphical hierarchies, or the portions thereof, to one or more complex two dimensional graphical hierarchies, or portions thereof, in the form of one or more edge and/or node labeled trees. 
     
     
         493 . The apparatus of  claim 488 , wherein at least one of the first and/or the second complex two dimensional graphical hierarchies, or the portions thereof, are to include at least one null symbol value. 
     
     
         494 . The apparatus of  claim 493 , wherein the complex two dimensional graphical hierarchy merger instructions are executable by the one or more processors to convert at least one of the first and/or the second complex two dimensional graphical hierarchies, or the portions thereof, that is to include the at least one null symbol value to a complex two dimensional hierarchy, or a portion thereof, without a null symbol value. 
     
     
         495 . The apparatus of  claim 494 , wherein the complex two dimensional graphical hierarchy merger instructions are executable by the one or more processors to convert at least one of the first and/or the second complex two dimensional hierarchies, or the portions thereof, without the null symbol value to one or more complex two dimensional hierarchies, or portions thereof, in the form of one or more edge labeled trees. 
     
     
         496 . The apparatus of  claim 494 , wherein the complex two dimensional graphical hierarchy merger instructions are executable by the one or more processors to convert the first and/or the second complex two dimensional hierarchies, or the portions thereof, without the null symbol value to one or more complex two dimensional hierarchies, or portions thereof, in the form of one or more node labeled trees. 
     
     
         497 . The apparatus of  claim 487 , wherein the symbol values are to comprise numerical symbol values. 
     
     
         498 . The apparatus of  claim 487 , wherein the symbol values are to comprise alphabetic symbol values. 
     
     
         499 . The apparatus of  claim 487 , wherein the one or more first symbol values to correspond to the first complex two dimensional graphical hierarchy, or the portion thereof, and the one or more second symbol values to correspond to the second complex two dimensional graphical hierarchy, or the portion thereof, are to be stored in memory via a look up table. 
     
     
         500 . An article comprising:
 a non-transitory storage medium comprises instructions stored thereon, the instructions are executable to merge at least a first complex two dimensional graphical hierarchy, or a portion thereof, and a second complex two dimensional graphical hierarchy, or a portion thereof, to yield a third complex two dimensional graphical hierarchy, or a portion thereof, the first, second and/or third complex two dimensional graphical hierarchies, or the portions thereof, are respectively \to include content from one or more databases;   wherein the instructions are to be accessible from the non-transitory storage medium and are to be stored as physical memory states on one or more physical memory devices, the one or more physical memory devices are to be coupled to one or more processors that are to be able to execute the instructions stored as physical memory states, the one or more physical memory devices are 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;   wherein the complex two dimensional graphical hierarchy merger instructions are executable to:   access from the one or more physical memory devices, one or more first symbol values that is to correspond to the first complex two dimensional graphical hierarchy, or the portion thereof, and one or more second symbol values that is to correspond to the second complex two dimensional graphical hierarchy, or the portion thereof; and   form the third complex two dimensional graphical hierarchy, or the portion thereof, based, at least in part, on the one or more first symbol values and the one or more second symbol values.   
     
     
         501 . The article of  claim 500 , wherein the symbol values are to comprise alphanumerical symbol values stored in the form of binary digital signal values. 
     
     
         502 . The article of  claim 500 , wherein the complex two dimensional graphical hierarchy merger instructions are executable by the one or more processors to display the third complex two dimensional graphical hierarchy, or the portion thereof. 
     
     
         503 . The article of  claim 500 , wherein the symbol values are to comprise numerical symbol values stored in the form of binary digital signal values. 
     
     
         504 . The article of  claim 500 , wherein at least one of the first and/or the second complex two dimensional graphical hierarchies, or the portions thereof, are to be in the form of one or more edge and/or node labeled trees, or portions thereof. 
     
     
         505 . The article of  claim 500 , wherein the complex two dimensional graphical hierarchy merger instructions are executable by the one or more processors to convert at least one of the first and/or the second complex two dimensional graphical hierarchies, or the portions thereof, to one or more complex two dimensional graphical hierarchies in the form of one or more edge and/or node labeled trees, or portions thereof. 
     
     
         506 . The article of  claim 501 , wherein at least one of the first and/or the second complex two dimensional graphical hierarchies, or the portions thereof, is to include at least one null symbol value. 
     
     
         507 . The article of  claim 506 , wherein the complex two dimensional graphical hierarchy merger instructions are executable by the one or more processors to convert at least one of the first and/or the second complex two dimensional graphical hierarchies, or the portions thereof, that is to include the at least one null symbol value to a complex two dimensional hierarchy, or a portion thereof, without a null symbol value. 
     
     
         508 . The article of  claim 507 , wherein the complex two dimensional graphical hierarchy merger instructions are executable by the one or more processors to convert at least one of the first and/or the second complex two dimensional hierarchies, or the portions thereof, without the null symbol value to one or more complex two dimensional hierarchies, or portions thereof, in the form of one or more edge labeled trees. 
     
     
         509 . The article of  claim 507 , wherein the complex two dimensional graphical hierarchy merger instructions are executable by the one or more processors to convert at least one of the first and/or the second complex two dimensional hierarchies, or the portions thereof, without the null symbol value to one or more complex two dimensional hierarchies, or portions thereof, in the form of one or more node labeled trees. 
     
     
         510 . The article of  claim 500 , wherein the symbol values are to comprise numerical symbol values. 
     
     
         511 . The article of  claim 500 , wherein the symbol values are to comprise alphabetic symbol values. 
     
     
         512 . The article of  claim 500 , wherein the one or more first symbol values to correspond to the first complex two dimensional graphical hierarchy, or the portion thereof, and the one or more second symbol values to correspond to the second complex two dimensional graphical hierarchy, or the portion thereof, are to be stored in memory via a look up table.