Adding and subtracting kstores

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.

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.