Manipulating sets of heirarchical data

• US 9,177,003 B2
• Filed: 09/09/2011
• Issued: 11/03/2015
• Est. Priority Date: 02/09/2004
• Status: Expired due to Fees

• Current Assignee: Lower48 IP, LLC (Lower48 Analytics, Inc.)
• Original Assignee: Robert T. Jenkins, Virginia T. Jenkins
• Inventors: Letourneau, Jack J.
• Primary Examiner(s): Ly, Cheyne D
• Application Number:
  US13/229,624
• Publication Number:
  US 20110320499A1
• Time in Patent Office: 1,516 Days
• Field of Search: 707/797
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees
• CPC Class Codes: G06F 16/258 Data format conversion from or to a database
• CPC Class Codes: G06F 16/282 Hierarchical databases, e.g. IMS, LDAP data stores or Lotus Notes

Abstract

Embodiments of methods, apparatus, devices and/or systems for manipulating hierarchical sets of data are discussed. For example, in one embodiment, a method of splitting a first tree into at least second and third trees includes the following. A first tree is converted to a first numeral via a computing platform. The first numeral is factored into at least second and third numerals. The at least second and third numerals are converted to at least second and third trees. Many other embodiments are disclosed.

Claims

1. A method of using digital signal values to extract one or more portions from a complex two dimensional graphical hierarchy, said complex two dimensional graphical hierarchy being in the form of a tree hierarchy, the method comprising:

executing instructions on one or more processors of one or more computing devices, comprising;

accessing from one or more memories one or more digital signal values comprising a composite numeral value representing said complex two dimensional graphical hierarchy based at least in part on a stored ordered association between numeral values and tree hierarchies;

for said one or more digital signal values comprising said composite numeral value, factoring said composite numeral value into two or more respective numeral values in the form of digital signal values;

selecting one of said respective factored numeral values so as to extract one or more portions of said complex two dimensional graphical hierarchy;

for one or more remaining numeral values after said selecting, using said stored ordered association to generate said complex two dimensional graphical hierarchy after the extraction; and

using said stored ordered association to produce one or more numeral values to represent said complex two dimensional hierarchy after the extraction and storing the one or more produced numeral values in memory as one or more digital signal values.

2. The method of claim 1, wherein said tree hierarchy comprises a binary edge labeled tree.

3. The method of claim 1, wherein said tree hierarchy is converted to a binary edge labeled tree.

4. The method of claim 1, wherein said tree hierarchy includes at least one null label.

5. The method of claim 4, wherein said tree hierarchy is converted to a tree hierarchy without a null label.

6. The method of claim 5, wherein said tree hierarchy without a null label is converted to a binary edge labeled tree.

7. The method of claim 1, wherein said tree hierarchy is converted to a binary node labeled tree.

8. The method of claim 1, wherein said composite numeral and respective numeral values comprise binary numerals.

9. The method of claim 1, wherein said composite numeral and respective numeral values are converted to binary numerals.

10. The method of claim 1, wherein said stored ordered association is stored in memory as a table.

11. The method of claim 10, wherein instead of storing the one or more produced numeral values in memory, displaying said complex two dimensional graphical hierarchy after the extraction.

12. An apparatus comprising:

a computing platform comprising a computing device having one or more processors;

said computing platform to;

access from one or more memories one or more digital signal values to comprise a composite numeral value to represent a complex two dimensional graphical hierarchy to be based at least in part on a stored ordered association between numeral values and tree hierarchies, wherein said complex two dimensional graphical hierarchy to be in the form of a tree hierarchy;

factor said composite numeral value into two or more respective numeral values in the form of digital signal values;

select one of said respective factored numeral values so as to extract one or more portions of said complex two dimensional graphical hierarchy;

use, for one or more remaining numeral values after selection of said one of said respective factored numeral values, said stored ordered association to generate said complex two dimensional graphical hierarchy after the extraction; and

use said stored ordered association to produce one or more numeral values to represent said complex two dimensional hierarchy after the extraction and store the one or more produced numeral values in memory as one or more digital signal values.

13. The apparatus of claim 12, wherein said tree hierarchy to comprise a binary edge labeled tree.

14. The apparatus of claim 12, wherein said computing platform to convert said tree hierarchy to a binary edge labeled tree.

15. The apparatus of claim 12, wherein said tree hierarchy to include at least one null label.

16. The apparatus of claim 15, wherein said computing platform to convert said tree hierarchy to a tree hierarchy without a null label.

17. The apparatus of claim 12, wherein said computing platform to convert said tree hierarchy to a binary node labeled tree.

18. The apparatus of claim 12, wherein said composite numeral and respective numeral values to comprise binary numerals.

19. The apparatus of claim 12, wherein said computing platform comprises a computer.

20. The apparatus of claim 12, wherein said computing platform to convert said composite numeral and respective numeral values to binary numerals.

21. The apparatus of claim 12, wherein said stored ordered association is to be stored in memory as a table.

22. The apparatus of claim 21, wherein said computing platform to display said complex two dimensional graphical hierarchy after the extraction instead of storing the one or more produced numeral values in memory.

23. An article comprising:

a non-transitory storage medium having stored thereon instructions executable by a computing platform comprising one or more computing devices having one or more processors to;

access from one or more memories one or more digital signal values to comprise a composite numeral value to represent a complex two dimensional graphical hierarchy to be based at least in part on a stored ordered association between numeral values and tree hierarchies, wherein said complex two dimensional graphical hierarchy is to be in the form of a tree hierarchy;

factor said composite numeral value into two or more respective numeral values in the form of digital signal values;

select one of said respective factored numeral values so as to extract one or more portions of said complex two dimensional graphical hierarchy;

use, for one or more remaining numeral values after selection of said one of said respective factored numeral values, said stored ordered association to generate said complex two dimensional graphical hierarchy after the extraction; and

use said stored ordered association to produce one or more numeral values to represent said complex two dimensional hierarchy after the extraction and store the one or more produced numeral values in memory as one or more digital signal values.

24. The article of claim 23, wherein said tree hierarchy is to comprise a binary edge labeled tree.

25. The article of claim 23, wherein said instructions further executable to convert said tree hierarchy to a binary edge labeled tree.

26. The article of claim 23, wherein said tree hierarchy to include at least one null label.

27. The article of claim 23, wherein said instructions are further executable to convert said tree hierarchy to a tree hierarchy without a null label.

28. The article of claim 27, wherein said instructions are further executable to convert said tree hierarchy without a null label to a binary edge labeled tree.

29. The article of claim 23, wherein said instructions are further executable to convert said tree hierarchy to a binary node labeled tree.

30. The article of claim 23, wherein said composite numeral and respective numeral values to comprise binary numerals.

31. The article of claim 23, wherein said instructions further executable to convert said composite numeral and respective numeral values to binary numerals.

32. The article of claim 23, wherein said stored ordered association is to be stored in memory as a table.

33. The article of claim 32, wherein said instructions are further executable to display said complex two dimensional graphical hierarchy after the extraction instead of storing the one or more produced numeral values in memory.