# US 2019/0377718 A1 · Method and/or system for tagging trees > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2019/0377718 A1 - Document ID: US20190377718A1 - Status: Published application - Kind: A1 - Application number: 16/459,930 - Filed: 2019-07-02 - Published: 2019-12-12 - Earliest claimed: 2004-10-29 - Assignees: Robert T. and Virginia T. Jenkins as Trustees of the Jenkins Family Trust Dated Feb. 8, 2002 - Applicants: Robert T. and Virginia T. Jenkins as Trustees of the Jenkins Family Trust Dated Feb. 8, 2002 - Inventors: Jack J. LeTourneau - Web page: https://patentgrep.com/patent/US20190377718A1 ## CPC - G06F 16/2246: {Trees, e.g. B+trees} - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract Embodiments of methods and/or systems for tagging trees are disclosed. ## Claims ### Claim at position 1 1-169. (canceled) ### Claim 170 A method of tagging tree hierarchies for node traversal, 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, including numerical signal values, resulting from having executed the accessed instructions on the one or more processors, wherein the one or more physical memory devices also store the database or the portion thereof; and wherein the accessed instructions to traverse nodes of tree hierarchies; wherein the executing the node traversal instructions comprises: associating numerical signal values with corresponding subtree structures; identifying a sequential numerical order of traversal for a selected group of nodes of a group of nodes of a complex tree hierarchy, the selected group of nodes to be labeled with sequential numerical signal values corresponding to the sequential numerical order of traversal; and attaching respective labeled edges and respective supporting nodes to the selected group of nodes. ### Claim 171 (depends on 170) The method of claim 170, wherein the executing the node traversal instructions further comprises: attaching respective subtree structures with edges labeled with specific content to the respective supporting nodes. ### Claim 172 (depends on 171) The method of claim 171, wherein the respective subtree structures are selected to be attached based at least in part on the sequential numerical signal value of nodes of the selected group of nodes and the corresponding subtree structure associated therewith. ### Claim 173 (depends on 172) The method of claim 172, wherein the executing the node traversal instructions further comprises: traversing the selected group of nodes in the sequential numerical order indicated by the attached respective subtree structures. ### Claim 174 (depends on 173) The method of claim 173, wherein the executing the node traversal instructions further comprises: locating the edges labeled with the specific content of the respective subtree structures. ### Claim 175 An 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 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, wherein the one or more physical memory devices, and wherein the executable instructions to traverse nodes of complex tree hierarchies; and wherein the execution of the node traversal instructions to: associate numerical signal values with corresponding subtree structures; identify a sequential numerical order of traversal for a selected group of nodes of a group of nodes of a complex tree hierarchy, the selected group of nodes to be labeled with sequential numerical signal values corresponding to the sequential numerical order of traversal; and attach respective labeled edges and respective supporting nodes to the selected group of nodes. ### Claim 176 (depends on 175) The apparatus of claim 175, and the node traversal instructions further to: attach respective subtree structures with edges labeled with specific content to the respective supporting nodes. ### Claim 177 (depends on 176) The apparatus of claim 176, wherein the respective subtree structures are selected to be attached based at least in part on the sequential numerical signal value of nodes of the selected group of nodes and the corresponding subtree structure associated therewith ### Claim 178 (depends on 177) The apparatus of claim 177, the node traversal instructions further to: traverse the selected group of nodes in the sequential numerical order indicated by the attached respective subtree structures. ### Claim 179 (depends on 177) The apparatus of claim 177, the node traversal instructions further to: locate the edges labeled with the specific content of the respective subtree structures. ### Claim 180 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 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, wherein the one or more physical memory devices also to store a database or portion thereof, and wherein the executable instructions to traverse nodes of complex tree hierarchies, and wherein the execution of the node traversal instructions to: associate numerical signal values with corresponding subtree structures; identify a sequential numerical order of traversal for a selected group of nodes of a group of nodes of a complex tree hierarchy, the selected group of nodes to be labeled with sequential numerical signal values corresponding to the sequential numerical order of traversal; and attach respective labeled edges and respective supporting nodes to the selected group of nodes. ### Claim 181 (depends on 180) The article of claim 180, and the node traversal instructions further to: attach respective subtree structures with edges labeled with specific content to the respective supporting nodes. ### Claim 182 (depends on 181) The article of claim 181, wherein the respective subtree structures are selected to be attached based at least in part on the sequential numerical signal value of nodes of the selected group of nodes and the corresponding subtree structure associated therewith. ### Claim 183 (depends on 182) The article of claim 182, and the node traversal instructions further to: traverse the selected group of nodes in the sequential numerical order indicated by the attached respective subtree structures. ### Claim 184 (depends on 183) The article of claim 183, and the node traversal instructions further to: locate the edges labeled with the specific content of the respective subtree structures. ### Claim 185 An apparatus, the 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 the 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 traverse nodes in complex tree hierarchies; and wherein the means for executing the accessed tree node traversal instructions comprises: means for associating numerical signal values with corresponding subtree structures; means for identifying a sequential numerical order of traversal for a selected group of nodes of a group of nodes of a complex tree hierarchy, the selected group of nodes to be labeled with sequential numerical signal values corresponding to the sequential numerical order of traversal; and means for attaching respective labeled edges and respective supporting nodes to the selected group of nodes. ### Claim 186 (depends on 185) The apparatus of claim 185, wherein the executing the node traversal instructions further comprises: means for attaching respective subtree structures with edges labeled with specific content to the respective supporting nodes. ### Claim 187 (depends on 186) The apparatus of claim 186, wherein the respective subtree structures are selected to be attached based at least in part on the sequential numerical signal value of nodes of the selected group of nodes and the corresponding subtree structure associated therewith. ### Claim 188 (depends on 187) The apparatus of claim 187, wherein the executing the node traversal instructions further comprises: means for traversing the selected group of nodes in the sequential numerical order indicated by the attached respective subtree structures. ### Claim 189 (depends on 188) The method of claim 188, wherein the executing the node traversal instructions further comprises: means for locating the edges labeled with the specific content of the respective subtree structures.