# US 2010/0169372 A1 · Adding and subtracting kstores

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

- Number: US 2010/0169372 A1
- Document ID: US20100169372A1
- Status: Published application
- Kind: A1
- Application number: 12/319,030
- Filed: 2008-12-31
- Published: 2010-07-01
- Earliest claimed: 2008-12-31
- Assignees: Unisys Corporation
- Inventors: Jane C. Mazzagatti
- Web page: https://patentgrep.com/patent/US20100169372A1

## CPC

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

## Abstract

The KStore is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. One KStore can be added to an existing KStore to create an updated KStore by traversing the trees of the KStores and incrementing the count fields to reflect the added counts of analogous nodes. New KStore structure is added as needed. A KStore can be subtracted from an existing KStore to create an updated KStore by traversing trees KStores and decrementing the count fields in the updated KStore to reflect the subtracted counts of analogous nodes. KStore structure is removed as needed. Portions of a KStore can be added or subtracted from another KStore by isolating the paths to be used for updating. Instead of incrementing or decrementing counts, a dataset of individual records can be recreated from the KStore.

## Claims

### Claim 1

A system that updates K datastores comprising:
an engine for processing KStores, a KStore comprising an interlocking trees datastore comprising elemental root nodes, subcomponent nodes and end product nodes linked by asCase and asResult bi-directional links that create asCase and asResult paths within the interlocking trees datastore, wherein an asCase path comprises a sequence of subcomponent nodes linked with bi-directional asCase links ending with an end product node and where each subcomponent node in the asCase path has a bi-directional asResult link to an elemental root node or end product node comprising an asResult tree, wherein the KStore processing engine updates an existing KStore to create an updated KStore by updating counts of analogous nodes based on the counts of the nodes in the updating KStore.

### Claim 2 (depends on 1)

The system of claim 1, wherein the engine creates individual dataset records and sends the individual dataset records to the KStore to be updated.

### Claim 3 (depends on 1)

The system of claim 1, wherein a portion not comprising the entirety of the updating KStore is used to update the updated KStore.

### Claim 4 (depends on 3)

The system of claim 3, wherein the portion of the updating KStore is isolated by following links of root nodes to subcomponent nodes, traversing an asCase path of the subcomponent node to an end product node of the asCase path, and determining a count associated with the isolated portion of the updating KStore.

### Claim 5 (depends on 1)

The system of claim 1, wherein a count associated with nodes of the updated KStore analogous to nodes of the updating KStore are incremented by a count associated with the nodes of the updating KStore.

### Claim 6 (depends on 1)

The system of claim 1, wherein a count associated with nodes of the updated KStore analogous to nodes of the updating KStore are decremented by a count associated with the nodes of the updating KStore.

### Claim 7 (depends on 1)

The system of claim 1, wherein the KStore processing engine, in response to determining that the existing KStore does not include analogous nodes to nodes of the updating KStore, nodes analogous to nodes of the updating KStore are added to the updated KStore, the added nodes associated with a count equal to the count of the updating nodes.

### Claim 8 (depends on 1)

The system of claim 1, wherein the KStore processing engine, in response to determining that a count associated with nodes of the updated KStore is zero or less than zero resulting from updating the updated KStore with the updating KStore, removes nodes of the updated KStore.

### Claim 9

A method for updating KStores comprising:
determining counts of nodes in an updating KStore processed by a KStore computer, the determined counts associated with nodes used to update counts of analogous nodes of an updated KStore;
updating the counts of the analogous nodes in the updated KStore, wherein a KStore comprises an interlocking trees datastore comprising elemental root nodes, subcomponent nodes and end product nodes linked by asCase and asResult bidirectional links that create asCase and asResult paths within the interlocking trees datastore, wherein an asCase path comprises a sequence of subcomponent nodes linked with bi-directional asCase links ending with an end product node and where each subcomponent node in the asCase path has a bi-directional asResult link to an elemental root node or end product node comprising an asResult tree.

### Claim 10 (depends on 9)

The method of claim 9, wherein a portion of the updating KStore is used to update the updated KStore.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
isolating the portion of the updating KStore to be used to update the updated KStore by following links of root nodes to subcomponent nodes, traversing an asCase path of the subcomponent node to an end product node of the asCase path.

### Claim 12 (depends on 9)

The method of claim 9, further comprising:
creating a dataset of individual records from paths of the updating KStore.

### Claim 13 (depends on 9)

The method of claim 9, further comprising:
updating counts of the analogous nodes in the updated KStore by adding the counts of the nodes in the updating KStore or by subtracting the counts of the nodes in the updating KStore.

### Claim 14 (depends on 9)

The method of claim 9, further comprising adding new nodes to the updated KStore or deleting nodes from the updated KStore.

### Claim 15

A computer-readable medium comprising computer-executable instructions that when executed, cause a computing environment to:
update a first KStore comprising an existing KStore with a second KStore comprising an updating KStore to generate a third KStore comprising an updated KStore by updating counts of nodes in the updated KStore, the nodes in the updated KStore analogous to nodes in the updating KStore, wherein a KStore comprises an interlocking trees datastore comprising elemental root nodes, subcomponent nodes and end product nodes linked by asCase and asResult bi-directional links that create asCase and asResult paths within the interlocking trees datastore, wherein an asCase path comprises a sequence of subcomponent nodes linked with bi-directional asCase links ending with an end product node and where each subcomponent node in the asCase path has a bi-directional asResult link to an elemental root node or end product node comprising an asResult tree.

### Claim 16 (depends on 15)

The computer-readable medium of claim 15, comprising further computer-executable instructions that when executed cause the computing environment to:
add counts associated with the nodes in the updating KStore to the counts of analogous nodes in the updated KStore or subtract counts associated with the nodes in the updating KStore from the counts of analogous nodes in the updated KStore.

### Claim 17 (depends on 15)

The computer-readable medium of claim 15, comprising further computer-executable instructions that when executed cause the computing environment to:
add new paths to the updated KStore analogous to paths in the updating KStore in response to determining that a node in the updating KStore has no analogous node in the existing KStore.

### Claim 18 (depends on 16)

The computer-readable medium of claim 16, comprising further computer-executable instructions that when executed cause the computing environment to:
remove a node from the updated KStore in response to determining that a count of the node is zero or less than zero.

### Claim 19 (depends on 16)

The computer-readable medium of claim 16, comprising further computer-executable instructions that when executed cause the computing environment to:
isolate a portion of an updating KStore to update the updated KStore by following links of elemental root nodes to subcomponent nodes, traversing an asCase path of the subcomponent node to an end product node of the asCase path.

### Claim 20 (depends on 15)

The computer-readable medium of claim 15, comprising further computer-executable instructions that when executed cause the computing environment to:
update the updated KStore by sending individual records of a dataset created from the updating KStore to the existing KStore, wherein the individual records of the dataset are applied to the existing KStore to create the updated KStore; or
update the updated KStore by sending individual records of a dataset created from a portion of the updating KStore to the existing KStore, wherein the individual records of the dataset are applied to the existing KStore to create the updated KStore.
