METHOD AND/OR SYSTEM FOR TRANSFORMING BETWEEN TREES AND ARRAYS
Embodiments of articles, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.
1 - 108 . (canceled)
109 . A 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 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 instructions on the one or more processors;
wherein the accessed instructions to transform between a tree and an array of numerical signal values; and
wherein executing the accessed transformation instructions further comprising:
transforming the tree to the array of numerical signal values, based at least in part on a one-to-one mapping between tree structures and unique elementary numerical signal values, the array of numerical signal values comprising one or more rows and columns of numerical signal values and an associated index for the one or more rows and columns of numerical signal values; and
storing the array of numerical signal values in the at least one or more physical memory devices.
110 . The method of claim 109 , wherein the array of numerical signal values comprises a condensed array of numerical signal values representing the tree in a compressed format.
111 . The method of claim 109 , wherein executing the accessed transformation instructions further comprises: associating numerical label values with at least some nodes and/or edges in the tree; and associating label values with at least some parent nodes of child nodes based, at least in part, on non-composite numerical signal values derived, at least in part, from label values associated with the child nodes.
112 . The method of claim 111 , wherein executing the accessed transformation instructions further comprises pruning the child nodes.
113 . The method of claim 111 , wherein a numerical label value associated with at least one of the parent nodes is based, at least in part, on a combination of non-composite numerical signal values derived, at least in part, from label values associated with the child nodes.
114 . The method of claim 111 , wherein executing the accessed transformation instructions further comprises determining the non-composite numerical signal values from an array of non-composite numerical signal values indexed by sequential indices.
115 . The method of claim 109 , wherein executing the accessed transformation instructions further comprises generating a resulting tree, wherein the generating the resulting tree comprises transforming the array of numerical signal values to a tree, based at least in part on the one-to-one mapping between the tree structures and the unique elementary numerical signal values.
116 . The method of claim 109 , wherein executing the accessed transformation instructions further comprises representing a parent node as a product of factors associated with one or more subtrees of the parent node.
117 . The method of claim 109 , wherein the transforming the tree to the array of numerical signal values comprises using digital signal values, responsive to executing the accessed transformation instructions, to select one or more numerical label values for portions of the tree and wherein the tree comprises a complex two dimensional graphical hierarchy, the complex two dimensional graphical hierarchy being in the form of a tree hierarchy.
118 . An apparatus comprising:
means for accessing instructions from one or more physical memory devices for execution by one or more processors; means for executing instructions accessed from the one or more physical memory devices by the one or more processors; means for storing, in at least one of the physical memory devices, signals values resulting from having executed the instructions on the one or more processors; wherein the accessed instructions to transform between a tree and an array of numerical signal values; and wherein the means for executing the transformation instructions comprises:
means transforming the tree to the array of numerical signal values, based at least in part on a one-to-one mapping between tree structures and unique elementary numerical signal values, the array of numerical signal values comprising one or more rows and columns of numerical signal values and an associated index for the one or more rows and columns of numerical signal values; and
means for storing the array of numerical signal values in the one or more physical memory devices.
119 . The apparatus of claim 118 , wherein the array of numerical signal values comprises a condensed array of numerical signal values representing the tree in a compressed format.
120 . The apparatus of claim 118 , wherein the means for executing the accessed transformation instructions further comprises: means for associating numerical label values with at least some nodes and/or edges in the tree; and means for associating label values with at least some parent nodes of child nodes based, at least in part, on non-composite numerical signal values derived, at least in part, from label values associated with the child nodes.
121 . The apparatus of claim 120 , wherein executing the accessed transformation instructions further comprises means for pruning the child nodes.
122 . The method of claim 120 , wherein a numerical label value associated with at least one of the parent nodes is based, at least in part, on a combination of non-composite numerical signal values derived, at least in part, from label values associated with the child nodes.
123 . The method of claim 118 , wherein the means for executing the accessed transformation instructions further comprises means for generating a resulting tree, wherein the generating the resulting tree comprises transforming the array of numerical signal values to a tree, based at least in part on the one-to-one mapping between the tree structures and the unique elementary numerical signal values.
124 . An article comprising:
a non-transitory storage medium comprising instructions stored thereon;
wherein the instructions being accessible from the non-transitory storage medium to store 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 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 executable instructions to transform between a tree and an array of numerical signal values; and
wherein the transformation instructions further to:
transform the tree to the array of numerical signal values, based at least in part on a one-to-one mapping between tree structures and unique elementary numerical signal values, the array of numerical signal values comprising one or more rows and columns of numerical signal values and an associated index for the one or more rows and columns of numerical signal values; and
store the array of numerical signal values in a memory of the computing device;
125 . The article of claim 124 , wherein the array of numerical signal values comprises a condensed array of numerical signal values representing the tree in a compressed format.
126 . The article of claim 124 , the transformation instructions being further executable by the one or more processors to: associate numerical label values with at least some nodes and/or edges in the tree; and associate label values with at least some parent nodes of child nodes based, at least in part, on non-composite numerical signal values derived, at least in part, from label values associated with the child nodes.
127 . The article of claim 126 , the transformation instructions being further executable by the one or more processors to prune child nodes.
128 . The article of claim 126 , wherein a numerical label value associated with at least one of the parent nodes is to be based, at least in part, on a combination of non-composite numerical signal values to be derived, at least in part, from label values to be associated with the child nodes.
129 . The article of claim 124 , the transformation instructions being further executable by the one or more processors to generate a resulting tree, wherein to generate the resulting tree comprises to transform the array of numerical signal values to a tree, based at least in part on the one-to-one mapping between the tree structures and the unique elementary numerical signal values.
130 . An apparatus comprising:
one or more processors coupled to one or more physical memory devices to store executable instructions and to store binary digital storage quantities as physical memory states, wherein the executable instructions being accessible from the one or more physical memory devices for execution by one or more processors; and
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 executable instructions to transform between a tree and an array of numerical signal values; and
wherein the transformation instructions further to:
transform the tree to the array of numerical signal values, based at least in part on a one-to-one mapping between tree structures and unique elementary numerical signal values, the array of numerical signal values comprising one or more rows and columns of numerical signal values and an associated index for the one or more rows and columns of numerical signal values; and
store the updated array of numerical signal values in one of the memory devices of the one or more physical memory devices of the computing device.
131 . The apparatus of claim 130 , wherein the array of numerical signal values comprises a condensed array of numerical signal values representing the tree in a compressed format.
132 . The apparatus of claim 130 , the transformation instructions being further executable to: associate numerical label values with at least some nodes and/or edges in the tree; and associate label values with at least some parent nodes of child nodes based, at least in part, on non-composite numerical signal values derived, at least in part, from label values associated with the child nodes.
133 . The apparatus of claim 132 , the transformation instructions being further executable to prune child nodes.
134 . The apparatus of claim 132 , wherein a numerical label value associated with at least one of the parent nodes is to be based, at least in part, on a combination of non-composite numerical signal values to be derived, at least in part, from label values to be associated with the child nodes.
135 . The article of claim 130 , the transformation instructions being further executable to generate a resulting tree, wherein to generate the resulting tree comprises to transform the array of numerical signal values to a tree, based at least in part on the one-to-one mapping between the tree structures and the unique elementary numerical signal values.