# US 2019/0171628 A1 · Manipulating sets of hierarchical data

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

- Number: US 2019/0171628 A1
- Document ID: US20190171628A1
- Status: Published application
- Kind: A1
- Application number: 16/209,872
- Filed: 2018-12-04
- Published: 2019-06-06
- Earliest claimed: 2004-02-09
- 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: Jack J. LeTourneau
- Web page: https://patentgrep.com/patent/US20190171628A1

## CPC

- G06F 16/2246: {Trees, e.g. B+trees}
- G06F 16/258: {Data format conversion from or to a database}
- G06F 16/282: {Hierarchical databases, e.g. IMS, LDAP data stores or Lotus Notes}
- 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.

## Claims

### Claim at position 1

1-473. (canceled)

### Claim 474

A method of merging at least a first complex two dimensional graphical hierarchy and a second complex two dimensional graphical hierarchy to yield a third complex two dimensional graphical hierarchy, the first, second, and third complex two dimensional graphical hierarchies being in the form of a labeled tree hierarchy that includes content originating from one or more databases, the method comprising:
accessing instructions from one or more physical memory devices for execution by one or more processors;
executing instructions accessed from the one or more physical devices by the one or more processors;
storing, in at least one of the physical memory devices, binary digital signal values resulting from having executed the instructions on the one or more processors;
wherein the accessed instructions are executable to merge complex two dimensional graphical hierarchies; and
wherein executing the complex hierarchy merger instructions further comprising:
accessing from the one or more physical memory devices, a first symbol value corresponding to the first complex two dimensional graphical hierarchy and a second symbol value corresponding to the second complex two dimensional graphical hierarchy, the first and second symbol values based, at least in part, on a stored association between symbol values and labeled tree hierarchies, wherein the complex two dimensional graphical hierarchies to be merged have a corresponding unique symbol value;
combining the first symbol value and the second symbol value to yield a third symbol value; and
forming the third complex two dimensional graphical hierarchy based, at least in part on the first and second complex two dimensional graphical hierarchies.

### Claim 475 (depends on 474)

The method of claim 474, wherein the symbol values comprise alphanumerical symbol values, stored in the form of binary digital signal values.

### Claim 476 (depends on 474)

The method of claim 474 wherein the executing the complex hierarchy merging instructions further comprises displaying the third complex two dimensional graphical hierarchy.

### Claim 477 (depends on 474)

The method of claim 474, wherein the symbol values comprise numerical symbol values, stored in the form of binary digital signal values.

### Claim 478 (depends on 474)

The method of claim 474, wherein the first and the second complex two dimensional graphical hierarchies are in the form of edge or node labeled trees.

### Claim 479 (depends on 474)

The method of claim 474, wherein the executing the complex hierarchy merging instructions further comprises converting the first and the second complex two dimensional graphical hierarchies to complex two dimensional hierarchies in the form of edge or node labeled trees.

### Claim 480 (depends on 475)

The method of claim 475, wherein at least one of the first and the second complex two dimensional graphical hierarchies includes at least one null symbol value.

### Claim 481 (depends on 480)

The method of claim 480, wherein the executing the complex hierarchy merging instructions further comprises converting the at least one of the first and the second complex two dimensional graphical hierarchies includes at least one null symbol value to a complex two dimensional graphical hierarchy without a null symbol value.

### Claim 482 (depends on 481)

The method of claim 481, wherein the executing the complex hierarchy merging instructions further comprises converting both the first and the second complex two dimensional hierarchies, without the null symbol value, to complex two dimensional hierarchies in the form of edge labeled trees.

### Claim 483 (depends on 474)

The method of claim 474, wherein the executing the complex hierarchy merging instructions further comprises converting both the first and the second complex two dimensional hierarchies, without the null symbol value, to complex two dimensional hierarchies in the form of node labeled trees.

### Claim 484 (depends on 475)

The method of claim 475, wherein the first and the second alphanumerical symbol values comprise binary symbol values.

### Claim 485 (depends on 475)

The method of claim 475, wherein the first and the second alphanumerical values are converted to binary symbol values.

### Claim 486 (depends on 474)

The method of claim 474, wherein the stored association is stored in memory as a table.

### Claim 487

An apparatus to merge at least a first complex two dimensional graphical hierarchy and a second complex two dimensional graphical hierarchy to yield a third complex two dimensional graphical hierarchy, the first, second, and third complex two dimensional graphical hierarchies to be in the form of a labeled tree hierarchy that is to include content originating from one or more databases, the 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 one or more physical memory devices for execution by the one or more processors;
the one or more processors able to store in at least one of the physical memory devices, binary digital signal quantities, if any, that are to result from execution of the instructions on the one or more processors, wherein the accessed instructions are to be executable to merge complex two dimensional graphical hierarchies: and
wherein the complex hierarchy merger instructions further to:
access from the one or more physical memory devices, a first symbol value to correspond to the first complex two dimensional graphical hierarchy and a second symbol value to correspond to the second complex two dimensional graphical hierarchy, the first and second symbol values to be based, at least in part, on a stored association between the symbol values and labeled tree hierarchies, wherein the complex two dimensional graphical hierarchies to be merged to have a corresponding unique symbol value;
combine the first symbol value and the second symbol value to yield a third symbol value; and
form the third complex two dimensional graphical hierarchy based, at least in part, on the first and second complex two dimensional graphical hierarchies.

### Claim 488 (depends on 487)

The apparatus of claim 487, wherein the symbol values comprise alphanumerical symbol values to be stored in the form of binary digital signal values.

### Claim 489 (depends on 487)

The apparatus of claim 487, wherein the complex hierarchy merger instructions to be further executable by the one or more processors to display the third complex two dimensional graphical hierarchy.

### Claim 490 (depends on 487)

The apparatus of claim 487, wherein the symbol values comprise numerical symbol values to be stored in the form of binary digital signal values.

### Claim 491 (depends on 487)

The apparatus of claim 487, wherein the first and the second complex two dimensional graphical hierarchies are to be in the form of edge or node labeled trees.

### Claim 492 (depends on 487)

The apparatus of claim 487, wherein the complex hierarchy merger instructions to be further executable by the one or more processors to convert the first and the second complex two dimensional graphical hierarchies to complex two dimensional graphical hierarchies in the form of edge or node labeled trees.

### Claim 493 (depends on 488)

The apparatus of claim 488, wherein at least one of the first and the second complex two dimensional graphical hierarchies is to include at least one null symbol value.

### Claim 494 (depends on 493)

The apparatus of claim 493, wherein the complex hierarchy merger instructions to be further executable by the one or more processors to convert at least one of the first and the second complex two dimensional graphical hierarchies that is to include the at least one null symbol value to a complex two dimensional hierarchy without a null symbol value.

### Claim 495 (depends on 494)

The apparatus of claim 494, wherein the complex hierarchy merger instructions to be further executable by the one or more processors to convert both the first and the second complex two dimensional hierarchies, without the null symbol value, to complex two dimensional hierarchies in the form of edge labeled trees.

### Claim 496 (depends on 494)

The apparatus of claim 494, wherein the complex hierarchy merger instructions to be further executable by the one or more processors to convert both the first and the second complex two dimensional hierarchies, without the null symbol value, to complex two dimensional hierarchies in the form of node labeled trees.

### Claim 497 (depends on 487)

The apparatus of claim 487 wherein the first and the second symbol values are to comprise binary symbol values.

### Claim 498 (depends on 487)

The apparatus of claim 487, wherein the complex hierarchy merger instructions being further executable by the one or more processors to convert the first and the second symbol values to binary symbol values.

### Claim 499 (depends on 487)

The apparatus of claim 487, wherein the stored association is to be stored in memory as a table.

### Claim 500

An article comprising:
a non-transitory storage medium comprising instructions stored thereon, the instructions to be executable to merge at least a first complex two dimensional graphical hierarchy and a second complex two dimensional graphical hierarchy to yield a third complex two dimensional graphical hierarchy, the first, second, and third complex two dimensional graphical hierarchies to be in the form of a labeled tree hierarchy that is to include content originating from one or more databases;
wherein the instructions to be accessible from the non-transitory storage medium and to be stored as physical memory states on one or more physical memory devices, the one or more physical memory devices coupled to one or more processors able to execute the instructions to be stored as physical memory states, the one or more physical memory devices also to be able to store binary digital signal quantities, if any, as physical memory states, that are to result from execution of the instructions on the one or more processors; and
wherein the executable complex hierarchy merger instructions further to:
access from the one or more physical memory devices, a first symbol value to correspond to the first complex two dimensional graphical hierarchy and a second symbol value to correspond to the second complex two dimensional graphical hierarchy, the first and second symbol values to be based, at least in part, on a stored association between symbol values and labeled tree hierarchies, wherein the complex two dimensional graphical hierarchies to be merged to have a corresponding unique symbol value:
combine the first symbol value and the second symbol value to yield a third symbol value; and
form the third complex two dimensional graphical hierarchy based, at least in part on, the first and second complex two dimensional graphical hierarchies.

### Claim 501 (depends on 500)

The article of claim 500, wherein the symbol values comprise alphanumerical symbol values to be stored in the form of binary digital signal values.

### Claim 502 (depends on 500)

The article of claim 500, wherein the complex hierarchy merger instructions to be further executable by the one or more processors to display the third complex two dimensional graphical hierarchy.

### Claim 503 (depends on 500)

The article of claim 500, wherein the symbol values comprise numerical symbol values to be stored in the form of binary digital signal values.

### Claim 504 (depends on 500)

The article of claim 500, wherein the first and the second complex two dimensional graphical hierarchies are to be in the form of edge or node labeled trees.

### Claim 505 (depends on 500)

The article of claim 500, wherein the complex hierarchy merger instructions to be further executable by the one or more processors to convert the first and the second complex two dimensional graphical hierarchies to complex two dimensional graphical hierarchies in the form of edge or node labeled trees.

### Claim 506 (depends on 501)

The article of claim 501, wherein at least one of the first and the second complex two dimensional graphical hierarchies is to include at least one null symbol value.

### Claim 507 (depends on 506)

The article of claim 506, wherein the complex hierarchy merger instructions to be further executable by the one or more processors to convert at least one of the first and the second complex two dimensional graphical hierarchies that is to include the at least one null symbol value to a complex two dimensional hierarchy without a null symbol value.

### Claim 508 (depends on 507)

The article of claim 507, wherein the complex hierarchy merger instructions to be further executable by the one or more processors to convert both the first and the second complex two dimensional hierarchies, without the null symbol value, to complex two dimensional hierarchies in the form of edge labeled trees.

### Claim 509 (depends on 507)

The article of claim 507, wherein the complex hierarchy merger instructions to be further executable by the one or more processors to convert both the first and the second complex two dimensional hierarchies, without the null symbol value, to complex two dimensional hierarchies in the form of node labeled trees.

### Claim 510 (depends on 500)

The article of claim 500 wherein the first and the second symbol values are to comprise binary symbol values.

### Claim 511 (depends on 500)

The article of claim 500, wherein the complex hierarchy merger instructions being further executable by the one or more processors to convert the first and the second symbol values to binary symbol values.

### Claim 512 (depends on 500)

The article of claim 500, wherein the stored association is to be stored in memory as a table.
