IP Library Granted Patent US 12,013,829
Granted Patent B2
US 12,013,829 · App. 17/378,119 · Granted Jun 18, 2024

Manipulation and/or analysis of hierarchical data

Inventors: Karl Schiffmann (Santa Barbara, CA); Jack J. LeTourneau (Ventura, CA); Mark Andrews (Pleasant Hill, CA)
Assignee: Lower48 IP LLC
G06F16/2246G06F16/245G06F16/282G06F16/9027
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 12,013,829
App. No.
17/378,119
Granted
Jun 18, 2024
Kind
B2
Abstract

Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular, methods, apparatus devices and or/or systems for analyzing hierarchical data are disclosed.

Claims (35)

1. A method comprising:

accessing a first set of instructions from one or more physical memory devices for execution by one or more processors;

executing the first set of 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, at least one target value resulting from having executed the first set of instructions on the one or more processors, wherein the one or more physical memory devices also store a database, wherein the at least one target value corresponds to at least some content within the database;

accessing a second set of instructions from one or more physical memory devices for execution by one or more processors;

executing the second set of instructions accessed from the one or more physical memory devices by the one or more processors;

wherein the executing the second set of instructions comprises:

transforming a query into a first hierarchically structured tree query;

processing the first hierarchically structured tree query in relation to the database, wherein the processing comprises comparing the first hierarchically structured tree query with the at least one target value; and

performing a fetch operation on the at least some content within the database, wherein the fetch operation occurs when there is a correspondence between the first hierarchically structured tree query and the at least one target value, wherein the fetch operation on the at least some content within the database comprises a response, the response comprising a hierarchically structured target tree, and wherein the target value is associated with the hierarchically structured target tree.

2. The method of claim 1 , wherein the query comprises a second hierarchically structured tree query.

3. The method of claim 1 , wherein the query comprises a query string.

4. The method of claim 1 , wherein the executing the first set of instructions further comprises:

locating the at least some content within the database.

5. The method of claim 1 , wherein the at least one target value comprises at least one numeral.

6. The method of claim 1 , wherein the at least one target value comprises numerical data.

7. The method of claim 1 , wherein comparing the first hierarchically structured tree query with the at least one target value comprises comparing a tree structure of the first hierarchically structured tree query with the at least one target value.

8. The method of claim 1 , wherein comparing the first hierarchically structured tree query with the at least one target value comprises comparing at least one subtree of the first hierarchically structured tree query with the at least one target value.

9. The method of claim 1 , wherein comparing the first hierarchically structured tree query with the at least one target value comprises comparing at least one node of the first hierarchically structured tree query with the at least one target value.

10. The method of claim 1 , wherein comparing the first hierarchically structured tree query with the at least one target value comprises comparing at least one edge of the first hierarchically structured tree query with the at least one target value.

11. The method of claim 1 , wherein the first hierarchically structured tree query comprises information of interest, and wherein comparing the first hierarchically structured tree query with the at least one target value comprises comparing the information of interest with the at least one target value.

12. The method of claim 1 , wherein the at least one target value comprises an array of target values, and wherein comparing the first hierarchically structured tree query with the at least one target value comprises comparing the first hierarchically structured tree query with the array of target values.

13. The method of claim 1 , wherein the first hierarchically structured tree query or portion thereof is associated with at least one probe value, and wherein comparing the first hierarchically structured tree query with the at least one target value comprises comparing the at least one probe value with the at least one target value.

14. The method of claim 13 , wherein the first hierarchically structured tree query or portion thereof being associated with the at least one probe value comprises a query tree structure of the first hierarchically structured tree query or a portion thereof being associated with the at least one probe value.

15. The method of claim 13 , wherein the first hierarchically structured tree query or portion thereof being associated with the at least one probe value comprises at least one query subtree of the first hierarchically structured tree query or a portion thereof being associated with the at least one probe value.

16. The method of claim 13 , wherein the first hierarchically structured tree query or portion thereof being associated with the at least one probe value comprises at least one node of the first hierarchically structured tree query or a portion thereof being associated with the at least one probe value.

17. The method of claim 13 , wherein the first hierarchically structured tree query or portion thereof being associated with the at least one probe value comprises at least one edge of the first hierarchically structured tree query or a portion thereof being associated with the at least one probe value.

18. The method of claim 13 , wherein the first hierarchically structured tree query comprises information of interest, and wherein the first hierarchically structured tree query or portion thereof being associated with the at least one probe value comprises the information of interest being associated with the at least one probe value.

19. The method of claim 1 , wherein the least one target value being associated with the hierarchically structured target tree comprises the at least one target value being associated with a target tree structure of the hierarchically structured target tree.

20. The method of claim 1 , wherein the least one target value being associated with the hierarchically structured target tree comprises the at least one target value being associated with at least one target subtree of the hierarchically structured target tree.

21. The method of claim 1 , wherein the least one target value being associated with the hierarchically structured target tree comprises the at least one target value being associated with at least one target node of the hierarchically structured target tree.

22. The method of claim 1 , wherein the least one target value being associated with the hierarchically structured target tree comprises the at least one target value being associated with at least one target edge of the hierarchically structured target tree.

23. The method of claim 1 , wherein hierarchically structured target tree comprises target data, and wherein the at least one target value being associated with the hierarchically structured target tree comprises the at least one target value being associated with the target data.

24. The method of claim 1 , wherein at least a portion of the at least some content within the database comprises a hierarchical structure.

25. The method of claim 1 , wherein the correspondence between the first hierarchically structured tree query and the at least one target value comprises a match between the first hierarchically structured tree query and the at least one target value.

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 16, 2021
From: SCHIFFMANN, KARL; LETOURNEAU, JACK J; ANDREWS, MARK
To: SKYLER TECHNOLOGY, INC.
Reel/Frame 056889/0480 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 16, 2021
From: SKYLER TECHNOLOGY, INC.
To: ROBERT T. AND VIRGINIA T. JENKINS AS TRUSTEES OF THE JENKINS FAMILY TRUST DATED FEBRUARY 8, 2002
Reel/Frame 056891/0561 →
Continuity (7)
Continuation 16164535 · Oct 18, 2018
Continuation 16048061 · Jul 27, 2018
Continuation 14968429 · Dec 14, 2015
Continuation 13030084 · Feb 17, 2011
Continuation 11412417 · Apr 26, 2006
Provisional Application 60675987 · Apr 29, 2005
Related Publication 20220043793A1 · Feb 10, 2022