IP Library Granted Patent US 11,100,070
Granted Patent B2
US 11,100,070 · App. 16/048,061 · Granted Aug 24, 2021

Manipulation and/or analysis of hierarchical data

Inventors: Karl Schiffmann (Santa Barbara, CA); Jack J. LeTourneau (Ventura, CA); Mark Andrews (Pleasant Hill, CA)
Assignee: Robert T. and Virginia T. Jenkins
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 11,100,070
App. No.
16/048,061
Granted
Aug 24, 2021
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 (89)

1. A method of querying a database, or a portion thereof, 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;

wherein the accessed instructions to transform the database, or the portion thereof, to the form of a hierarchically structured tree via one or more numerical signal values corresponding to content within the database, or the portion thereof;

wherein the executing the transformation instructions comprises:

generating the hierarchically structured tree via the one or more numerical signal values, the hierarchically structured tree comprising electronic content including binary digital signals and/or states; and

wherein the executing the transformation instructions comprises:

presenting a query to the database, or the portion thereof, via at least one numerical signal value to fetch the content within the database, or the portion thereof.

2. The method of claim 1 , and wherein the executing the transformation instructions comprises:

identifying at least some of a plurality of partial subtrees of the hierarchically structured tree, wherein the plurality of partial subtrees are also in the form of signals and/or states;

enumerating at least some partial subtrees of the at least some identified partial subtrees;

associating the at least one numerical signal value with at least one of the at least some enumerated partial subtrees; and

determining the at least one numerical signal value based, at least in part, on an association of numerical signal values with at least some of the at least some enumerated partial subtrees of the at least some identified partial subtrees.

3. The method of claim 2 , wherein the identifying the at least some of the plurality of partial subtrees of the hierarchically structured tree comprises:

identifying, from non-terminal nodes of the hierarchically structured tree, any root nodes of the at least some identified partial subtrees; and

identifying one or more nodes descending from the root node of the at least some identified partial subtrees to be one or more nodes of the at least some enumerated partial subtrees.

4. The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees down to a depth to be one or more nodes of the at least some enumerated partial subtrees.

5. The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees based, at least in part, on one or more node label values associated with the one or more nodes.

6. The method of claim 1 , and wherein the executing the transformation instructions comprises:

comparing one or more probe numerical signal values with at least one target numerical signal value of the one or more numerical signal values, which is indicative of a presence of the content in the database, or the portion thereof, wherein the one or more probe numerical signal values are also based, at least in part, on an association of trees and numerical signal values, and

wherein a correspondence between at least one of the one or more probe numerical signal values and the at least one target numerical signal value includes a match between the at least one probe numerical signal value and the at least one target numerical signal value.

7. The method of claim 1 , and wherein the executing the transformation instructions further comprises: locating the content in the database, or the portion thereof.

8. The method of claim 1 , wherein the executing the transformation instructions comprises identifying one or more query fields of the query.

9. The method of claim 8 , wherein the executing the transformation instructions comprises enumerating at least some hierarchical query fields of the identified one or more query fields.

10. The method of claim 9 , wherein the executing the transformation instructions comprises associating the at least one numerical signal value with at least one of the at least some hierarchical query fields.

11. The method of claim 10 , wherein the executing the transformation instructions comprises comparing the at least one numerical signal value associated with the at least one hierarchical query fields and the one or more numerical signal values associated with the content within the database, or the portion thereof, to fetch the content via the at least one numerical signal value.

12. An apparatus comprising:

one or more processors coupled to one or more physical memory devices are to store executable instructions and are to store binary digital signal quantities, as physical memory states, wherein the executable instructions are to be accessible from the one or more physical memory devices for execution by the one or more processors;

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, wherein the one or more physical memory devices also are to store a database, or a portion thereof, wherein the executable instructions are to transform the database, or the portion thereof, to the form of a hierarchically structured tree via one or more numerical signal values to correspond to content within the database, or the portion thereof;

wherein the transformation instructions are to:

generate the hierarchically structured tree via the one or more numerical signal values, wherein the hierarchically structured tree is to comprise electronic content comprising binary digital signals and/or states; and

wherein the transformation instructions are to:

present a query to the database, or the portion thereof, via at least one numerical signal value to fetch the content within the database, or the portion thereof.

13. The apparatus of claim 12 , and wherein the transformation instructions are to:

identify at least some of a plurality of partial subtrees of the hierarchically structured tree, wherein the plurality of partial subtrees are also in the form of signals and/or states;

enumerate at least some partial subtrees of the at least some identified partial subtrees;

associate the at least one numerical signal value with at least one of the at least some enumerated partial subtrees; and

determine the at least one numerical signal value based, at least in part, on an association of numerical signal values with at least some of the at least some to be enumerated partial subtrees of the at least some to be identified partial subtrees.

14. The apparatus of claim 13 , wherein the transformation instructions to identify the at least some partial subtrees of the hierarchically structured tree are to:

identify, from non-terminal nodes of the tree, any root nodes of the at least some to be identified partial subtrees; and

identify one or more nodes to descend from the root node of the at least some to be identified partial subtrees to be one or more nodes of the at least some to be enumerated partial subtrees.

15. The apparatus of claim 14 , wherein the transformation instructions to identify the one or more nodes to descend from the root node of the at least some to be identified partial subtrees are to identify the one or more nodes to descend from the root node of the at least some to be identified partial subtrees down to a depth to be one or more nodes of the at least some to be enumerated partial subtrees.

16. The apparatus of claim 14 , wherein the transformation instructions to identify the one or more nodes to descend from the root node of the at least some to be identified partial subtrees are to identify the one or more nodes to descend from the root node of the at least some to be identified partial subtrees based, at least in part, one or more on node values to be associated with the one or more nodes.

17. The apparatus of claim 12 , wherein the transformation instructions are to:

compare one or more probe numerical signal values with at least one target numerical signal value of the one or more numerical signal values, which is to be indicative of a presence of the content in the database, or the portion thereof, wherein the one or more probe numerical signal values are also to be based, at least in part, on an association of trees and numerical signal values, and

wherein a correspondence between at least one of the one or more probe numerical signal values and the at least one target numerical signal value is to include a match between the at least one numerical signal value and the at least one target numerical signal value.

18. The apparatus of claim 13 , wherein the transformation instructions are to:

generate a first array of target numerals to comprise numerical signal values in the form of signals and/or states to be associated with the at least some to be identified partial subtrees; and

update the first array of target numerical signal values to be based at least in part on a combination of the one or more target numerical signal values to represent the tree with the numerical signal values of the first array of target numerical signal values.

19. The apparatus of claim 12 , wherein the transformation instructions are to: locate the content to be in the database, or the portion thereof.

20. The apparatus of claim 12 , and wherein the transformation instructions are to:

identify one or more query fields of the query.

21. The apparatus of claim 20 , and wherein the transformation instructions are to:

enumerate at least some hierarchical query fields of the to be identified one or more query fields.

22. The apparatus of claim 21 , and wherein the transformation instructions are to:

associate the at least one numerical signal value with at least one of the at least some hierarchical query fields.

23. The apparatus of claim 22 , and wherein the transformation instructions are to:

compare the at least one numerical signal value to be associated with the at least one hierarchical query fields and the one or more numerical signal values associated with the content within the database, or the portion thereof, to fetch the content via the at least one numerical signal value.

24. An article comprising: a non-transitory storage medium that includes 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 physical memory devices are to store instructions, including the executable instructions, and are to store binary digital signal quantities, as physical memory states, wherein the executable instructions are to be accessible from the one or more physical memory devices for execution by the one or more processors;

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, wherein the one or more physical memory devices are also to store a database, or the portion thereof, and wherein the executable instructions are to transform the database, or the portion thereof, to the form of a hierarchically structured tree via one or more numerical signal values to correspond to content within the database, or the portion thereof;

wherein the transformation instructions are to:

generate the hierarchically structured tree via the one or more numerical signal values, wherein the hierarchically structured tree is to comprise electronic content comprising binary digital signals and/or states; and

wherein the transformation instructions are to:

present a query to the database, or the portion thereof, via at least one numerical signal value to fetch the content within the database, or the portion thereof.

25. The article of claim 24 , and wherein the transformation instructions are to:

identify at least some of a plurality of partial subtrees of the hierarchically structured tree, wherein the plurality of partial subtrees are also in the form of signals and/or states;

enumerate at least some partial subtrees of the at least some identified partial subtrees;

associate the at least one numerical signal value with at least one of the at least some enumerated partial subtrees; and

determine the at least one numerical signal value based, at least in part, on an association of numerical signal values with at least some of the at least some to be enumerated partial subtrees of the at least some to be identified partial subtrees.

26. The article of claim 25 , wherein the transformation instructions to identify the at least some partial subtrees of the hierarchically structured tree are to:

identify, from non-terminal nodes of the tree, any root nodes of the at least some to be identified partial subtrees; and

identify one or more nodes to descend from the root node of the at least some to be identified partial subtrees to be one or more nodes of the at least some to be enumerated partial subtrees.

27. The article of claim 26 , wherein the transformation instructions to identify the one or more nodes to descend from the root node of the at least some to be identified partial subtrees are to identify the one or more nodes to descend from the root node of the at least some to be identified partial subtrees down to a depth to be one or more nodes of the at least some to be enumerated partial subtrees.

28. The article of claim 26 , wherein the transformation instructions to identify the one or more nodes to descend from the root node of the at least some to be identified partial subtrees are to identify the one or more nodes to descend from the root node of the at least some to be identified partial subtrees based, at least in part, on one or more node label values associated with the one or more nodes.

29. The article of claim 24 , wherein the transformation instructions are to:

compare one or more probe numerical signal values with at least one target numerical signal value of the one or more numerical signal values, which is to be indicative of a presence of the content in the database, or the portion thereof, wherein the one or more probe numerical signal values are also to be based, at least in part, on an association of trees and numerical signal values, and

wherein a correspondence between at least one of the one or more probe numerical signal values and the at least one target numerical signal value is to include a match between the at least one probe numerical signal value and the at least one target numerical signal values.

30. The article of claim 25 , wherein the transformation instructions are to:

generate a first array of target numerals to comprise numerical signal values in the form of signals and/or states to be associated with the at least some to be identified partial subtrees; and

update the first array of target numerical signal values to be based at least in part on a combination of the one or more target numerical signal values to represent the hierarchically structured tree with the numerical signal values of the first array of target numerical signal values.

31. The article of claim 24 , wherein the transformation instructions are to: locate the content to be in the database, or the portion thereof.

32. The article of claim 24 , wherein the transformation instruction are to:

identify one or more query fields of the query.

33. The article of claim 32 , wherein the transformation instructions are to:

enumerate at least some hierarchical query fields of the identified one or more query fields.

34. The article of claim 33 , wherein the transformation instructions are to:

associate the at least one numerical signal value with at least one of the at least some hierarchical query fields.

35. The article of claim 34 , and wherein the transformation instructions are to: compare the at least one numerical signal value associated with the at least one hierarchical query fields and the one or more numerical signal values to be associated with the content within the database, or the portion thereof, to fetch the content via the at least one numerical signal value.

Assignments (4)
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 →
CORRECTIVE ASSIGNMENT TO CORRECT THE NAME VIRGINIA IN THE NAME OF THE ASSIGNEE PREVIOUSLY RECORDED ON REEL 046490 FRAME 0463. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Jul 31, 2018
From: SKYLER TECHNOLOGY, INC.
To: ROBERT T. AND VIRGINIA T. JENKINS AS TRUSTEES OF THE JENKINS FAMILY TRUST DATED FEB. 8, 2002
Reel/Frame 046671/0571 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 27, 2018
From: SCHIFFMANN, KARL; LETOURNEAU, JACK J.; ANDREWS, MARK
To: SKYLER TECHNOLOGY, INC.
Reel/Frame 046490/0428 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 27, 2018
From: SKYLER TECHNOLOGY, INC.
To: ROBERT T. AND VIRINIA T. JENKINS AS TRUSTEES OF THE JENKINS FAMILY TRUST DATED FEB. 8, 2002
Reel/Frame 046490/0463 →
Continuity (5)
Continuation 14968429 · Dec 14, 2015
Continuation 13030084 · Feb 17, 2011
Continuation 11412417 · Apr 26, 2006
Provisional Application 60675987 · Apr 29, 2005
Related Publication 20190026326A1 · Jan 24, 2019
Cited By (1)
US 12,277,136