IP Library Granted Patent US 11,314,709
Granted Patent B2
US 11,314,709 · App. 16/459,930 · Granted Apr 26, 2022

Method and/or system for tagging trees

Inventor: Jack J. LeTourneau (Ventura, CA)
Assignee: Robert T. and Virginia T. Jenkins
G06F16/2246
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,314,709
App. No.
16/459,930
Granted
Apr 26, 2022
Kind
B2
Abstract

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

Claims (55)

1. 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 a database or a 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.

2. The method of claim 1 , wherein the executing the node traversal instructions further comprises:

attaching respective subtree structures with edges labeled with specific content to the respective supporting nodes.

3. The method of claim 2 , 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.

4. The method of claim 3 , 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.

5. The method of claim 4 , wherein the executing the node traversal instructions further comprises: locating the edges labeled with the specific content of the respective subtree structures.

6. 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.

7. The apparatus of claim 6 , and the node traversal instructions further to:

attach respective subtree structures with edges labeled with specific content to the respective supporting nodes.

8. The apparatus of claim 7 , 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.

9. The apparatus of claim 8 , the node traversal instructions further to:

traverse the selected group of nodes in the sequential numerical order indicated by attached respective subtree structures.

10. The apparatus of claim 9 , the node traversal instructions further to:

locate the edges labeled with specific content of the respective subtree structures.

11. 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.

12. The article of claim 11 , and the node traversal instructions further to:

attach respective subtree structures with edges labeled with specific content to the respective supporting nodes.

13. The article of claim 12 , 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.

14. The article of claim 13 , 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.

15. The article of claim 14 , and the node traversal instructions further to:

locate the edges labeled with the specific content of the respective subtree structures.

16. 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.

17. The apparatus of claim 16 , 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.

18. The apparatus of claim 17 , 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.

19. The apparatus of claim 18 , 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.

20. The apparatus of claim 19 , wherein the executing the node traversal instructions further comprises: means for locating the edges labeled with the specific content of the respective subtree structures.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 4, 2022
From: ROBERT T. AND VIRGINIA T. JENKINS AS TRUSTEES OF THE JENKINS FAMILY TRUST DATED FEB. 8, 2002
To: LOWER48 IP LLC
Reel/Frame 061881/0304 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 2, 2019
From: LETOURNEAU, JACK J.
To: SKYLER TECHNOLOGY, INC.
Reel/Frame 049653/0012 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 2, 2019
From: SKYLER TECHNOLOGY, INC.
To: ROBERT T. AND VIRGINIA T. JENKINS AS TRUSTEES OF THE JENKINS FAMILY TRUST DATED FEB. 8, 2002
Reel/Frame 049653/0104 →
Continuity (4)
Continuation 12830236 · Jul 2, 2010
Division 11006446 · Dec 6, 2004
Provisional Application 60623352 · Oct 29, 2004
Related Publication 20190377718A1 · Dec 12, 2019