Method and/or system for tagging trees

Abstract

Embodiments of methods and/or systems for tagging trees are disclosed.

1 - 170 . (canceled) 
     
     
         171 . A method comprising:
 accessing instructions from one or more physical memory devices for execution by one or more processors;   executing the instructions accessed from the one or more physical memory devices by the one or more processors;   storing, in at least one of the physical memory devices, signal values resulting from having executed the accessed instructions on the one or more processors; and   tagging subtree structures of a data representation for node traversal, wherein tagging comprises:
 associating signal values with the corresponding subtree structures; 
 identifying a sequential order of traversal for a selected group of nodes of a subtree structure of the data representation, the selected group of nodes to be labeled with sequential signal values corresponding to the sequential order of traversal; and 
 attaching respective labeled edges and respective supporting nodes to the selected group of nodes. 
   
     
     
         172 . The method of  claim 171 , further comprising:
 executing the accessed instructions to traverse nodes of the data representation, wherein the data representation is a complex tree hierarchy.   
     
     
         173 . The method of  claim 171 , wherein the signal values comprise: numerical signal values, and wherein the sequential order of traversal comprises a sequential numerical order of traversal. 
     
     
         174 . The method of  claim 171 , wherein the signal values comprise: character signal values, and wherein the sequential order of traversal comprises a sequential character order of traversal. 
     
     
         175 . The method of  claim 171 , wherein the executing the tagging further comprises:
 attaching respective subtree structures with edges labeled with specific content to the respective supporting nodes.   
     
     
         176 . The method of  claim 175 , wherein the respective subtree structures are selected to be attached based at least in part on the sequential signal value of nodes of the selected group of nodes and the corresponding subtree structure associated therewith. 
     
     
         177 . The method of  claim 176 , wherein the tagging further comprises:
 traversing the selected group of nodes in the sequential order indicated by the attached respective subtree structures.   
     
     
         178 . The method of  claim 177 , wherein the tagging further comprises:
 locating the edges labeled with the specific content of the respective subtree structures.   
     
     
         179 . An apparatus comprising:
 one or more processors coupled to one or more physical memory devices to store executable instructions and to store digital signal quantities as physical memory states, wherein the executable instructions being accessible from the one or more physical memory devices for execution by the one or more processors; and   the one or more processors able to store in at least one of the physical memory devices, binary signal quantities, if any, that are to result from execution of the instructions on the one or more processors, and tag subtree structures of a data representation for node traversal to:
 associate signal values with the corresponding subtree structures; 
 identify a sequential order of traversal for a selected group of nodes of a subtree structure of the data representation, the selected group of nodes to be labeled with sequential signal values corresponding to the sequential order of traversal; and 
 attach respective labeled edges and respective supporting nodes to the selected group of nodes. 
   
     
     
         180 . The apparatus of  claim 179 , wherein the signal values comprise: one of numerical signal values and character signal values, and
 wherein the sequential order of traversal comprises one of a sequential numerical order when the signal values comprise numerical signal values, or a sequential character order of traversal when the signal values comprise character signal values.   
     
     
         181 . The apparatus of  claim 179 , wherein to tag subtree structures for node traversal further to:
 attach respective subtree structures with edges labeled with specific content to the respective supporting nodes.   
     
     
         182 . The apparatus of  claim 181 , wherein the respective subtree structures are selected to be attached based at least in part on the sequential signal value of nodes of the selected group of nodes and the corresponding subtree structure associated therewith. 
     
     
         183 . The apparatus of  claim 182 , wherein the one or more processors are able to tag the subtree structures of the data representation for node traversal further to:
 traverse the selected group of nodes in the sequential order indicated by attached respective subtree structures.   
     
     
         184 . The apparatus of  claim 183 , wherein the one or more processors are able to tag the subtree structures of the data representation for node traversal further to:
 locate the edges labeled with specific content of the respective subtree structures.   
     
     
         185 . An article comprising:
 a non-transitory storage medium including executable instructions stored thereon; wherein the instructions are executable by one or more processors to be coupled to one or more physical memory devices, the devices to store instructions, including the executable instructions, and to store binary digital signal quantities as physical memory states, wherein the executable instructions to be accessible from the one or more physical memory devices for execution by the one or more processors; and   wherein the one or more processors are able to store in at least one of the physical memory devices, binary signal quantities, if any, that are to result from execution of the instructions on the one or more processors, and tag subtree structures of a data representation for node traversal to:
 associate numerical values with corresponding subtree structures; 
 identify a sequential order of traversal for a selected group of nodes of a subtree structure of the data representation, the selected group of nodes to be labeled with sequential signal values corresponding to the sequential order of traversal; and 
 attach respective labeled edges and respective supporting nodes to the selected group of nodes. 
   
     
     
         186 . The article of  claim 185 , wherein the signal values comprise: one of numerical signal values and character signal values, and
 wherein the sequential order of traversal comprises one of a sequential numerical order when the signal values comprise numerical signal values, or a sequential character order of traversal when the signal values comprise character signal values.   
     
     
         187 . The article of  claim 185 , wherein to tag subtree structures for node traversal further to:
 attach respective subtree structures with edges labeled with specific content to the respective supporting nodes.   
     
     
         188 . The article of  claim 187 , wherein the respective subtree structures are selected to be attached based at least in part on the sequential signal value of nodes of the selected group of nodes and the corresponding subtree structure associated therewith. 
     
     
         189 . The article of  claim 188 , wherein the one or more processors are able to tag the subtree structures of the data representation for node traversal further to:
 traverse the selected group of nodes in the sequential order indicated by the attached respective subtree structures.   
     
     
         190 . The article of  claim 189 , wherein the one or more processors are able to tag the subtree structures of the data representation for node traversal further to:
 locate the edges labeled with the specific content of the respective subtree structures.