# US 2017/0255660 A1 · Enumeration of rooted partial subtrees

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0255660 A1
- Document ID: US20170255660A1
- Status: Published application
- Kind: A1
- Application number: 15/464,205
- Filed: 2017-03-20
- Published: 2017-09-07
- Earliest claimed: 2004-12-30
- 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: Karl Schiffmann; Jack J. LeTourneau; Mark Andrews
- Web page: https://patentgrep.com/patent/US20170255660A1

## CPC

- G06F 16/2246: {Trees, e.g. B+trees}
- G06F 16/2455: Query execution
- G06F 16/9027: {Trees}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## 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 enumerating rooted partial subtrees are disclosed.

## Claims

### Claim at position 1

1-56. (canceled)

### Claim 57

A method of executing instructions on at least one computing device in which the at least one computing device includes at least one processor and at least one memory, the method comprising:
communicating instructions from the at least one memory to the at least one processor; and
executing the communicated instructions on the at least one processor of the at least one computing device;
wherein the communicated instructions comprise instructions to manipulate a set of states stored as a hierarchical set; and
wherein the executing the manipulation instructions further comprise:
representing the hierarchical set of stored states, at least in part, as a complex tree hierarchy, wherein the complex tree hierarchy comprises a set of rooted partial subtrees, and wherein the rooted partial subtrees represent at least a portion of the states in the complex tree hierarchy;
associating numerals with respect to respective rooted partial subtrees in the set of rooted partial substrees; and
performing one or more operations on the hierarchical set of stored states.

### Claim 58 (depends on 57)

The method of claim 57, wherein the performing an operation on the hierarchical set of stored states comprises performing one or more arithmetic operations on at least some of the numerals associated with the respective rooted partial subtrees.

### Claim 59 (depends on 57)

The method of claim 57 wherein the executing the manipulation instructions further comprises:
associating numerals with respective rooted partial subtrees, wherein the associating numerals with respective rooted partial subtrees comprises providing relationships between the respective rooted partial subtrees.

### Claim 60 (depends on 59)

The method of claim 59, wherein the performing one or more operations on the hierarchical set of stored states is based, at least in part, on the relationships between the respective rooted partial subtrees.

### Claim 61 (depends on 57)

The method of claim 57, wherein the complex tree hierarchy comprises one or more subtrees coupled to a root node of the complex tree hierarchy, and wherein at least some of the one or more subtrees respectively comprise a set of rooted partial subtrees.

### Claim 62 (depends on 61)

The method of claim 61, wherein the executing the manipulation instructions further comprises:
enumerating at least some of corresponding rooted partial subtrees of the at least some of the one or more subtrees.

### Claim 63 (depends on 62)

The method of claim 62, wherein the performing one or more operations on the hierarchical set of stored states is based, at least in part, on relationships between the respective rooted partial subtrees provided substantially in accordance with the numerals associated with the respective rooted partial subtrees.

### Claim 64

An apparatus comprising:
at least one computing device in which the at least one computing device includes at least one processor and at least one memory;
the at least one memory to communicate instructions to the at least one processor;
the at least one processor to execute the communicated instructions;
wherein the communicated instructions to be executed comprise instructions to manipulate a set of states stored as a hierarchical set; and
wherein the manipulation instructions to be executed comprise instructions further to:
represent the hierarchical set of stored states, at least in part, as a complex tree hierarchy, the complex tree hierarchy to comprise a set of rooted partial subtrees, and the rooted partial subtrees to represent at least a portion of the states to be represented by the complex tree hierarchy;
associate numerals with respect to respective rooted partial subtrees in the set of rooted partial subtrees; and
perform an operation on at least some of the hierarchical set of stored states.

### Claim 65 (depends on 64)

The apparatus of claim 64 wherein the performance instructions comprise further instructions to:
compute one or more arithmetic operations on at least some of the numerals to be associated with the respective rooted partial subtrees.

### Claim 66 (depends on 64)

The apparatus of claim 64 wherein the manipulation instructions to associate numerals with respective rooted partial subtrees further comprises instructions to relate the respective rooted partial subtrees based, at least in part, on the respective associated numerals.

### Claim 67 (depends on 66)

The apparatus of claim 66, wherein the manipulation instructions to perform operations on at least some of hierarchical set of stored states comprise further instructions to perform the arithmetic operations based, at least in part, on the relationships between the respective rooted partial subtrees.

### Claim 68 (depends on 64)

The apparatus of claim 64, wherein the complex tree hierarchy is to comprise one or more subtrees to be coupled to a root node of the complex tree hierarchy, and wherein at least some of the one or more subtrees to comprise a set of corresponding rooted partial subtrees.

### Claim 69 (depends on 68)

The apparatus of claim 68, wherein the manipulation instructions comprise further instructions to:
enumerate at least some of corresponding rooted partial subtrees of the at least some of the one or more subtrees.

### Claim 70 (depends on 69)

The apparatus of claim 69, wherein the manipulation instructions to perform an operation on at least some of the hierarchical set of stored states comprise further instructions to perform the arithmetic operations, based, at least in part, on relationships between the respective rooted partial subtrees established, at least in part by, numerals to be associated with the respective rooted partial subtrees.

### Claim 71

An article comprising:
a non-transitory storage medium comprising:
device-readable instructions stored thereon executable by at least one computing device, the at least one computing device comprising at least one processor and at least one memory, to:
communicate instructions from the at least one memory to the at least one processor; and
execute the to be communicated instructions on the at least one processor;
wherein the to be communicated instructions to be executed to comprise instructions to manipulate a set of states stored as a hierarchical set; and
wherein the manipulation instructions to be executed comprise instructions to:
manipulate a set of states stored as a hierarchical set;
represent the hierarchical set of stored states, at least in part, as a complex tree hierarchy, the complex tree hierarchy to comprise a set of rooted partial subtrees, and the rooted partial subtrees represent, at least a portion of the states to be represented by the complex tree hierarchy;
associate numerals with respect to respective rooted partial subtrees in the set of rooted partial subtrees; and
perform one or more operations on at least some of the hierarchical set of stored states.

### Claim 72 (depends on 71)

The non-transitory storage medium of claim 71, wherein the performance instructions comprise further instructions to:
compute one or more arithmetic operations on at least some of the numerals to be associated with the respective rooted partial subtrees.

### Claim 73 (depends on 71)

The non-transitory storage medium of claim 71 wherein the manipulation instructions to associate numerals with respective rooted partial subtrees comprise further instructions to establish relationships between the respective rooted partial subtrees.

### Claim 74 (depends on 73)

The non-transitory storage medium of claim 73, wherein the manipulation instructions to perform the operation on the hierarchical set of stored states comprise further instructions to manipulate the respective rooted partial subtrees, based, at least in part, on numerals to be associated with the respective rooted partial subtrees.

### Claim 75 (depends on 71)

The non-transitory storage medium of claim 71, wherein the complex tree hierarchy comprises one or more subtrees coupled to a root node of the complex tree hierarchy, at least some of the one or more subtrees to comprise a set of corresponding rooted partial subtrees.

### Claim 76 (depends on 75)

The non-transitory storage medium of claim 75, wherein the manipulation instructions comprise further instructions to:
enumerate at least some of corresponding rooted partial subtrees of the at least some of the one or more subtrees.
