Facilitated use of column and field data for field record universe in a knowledge store
First Claim
1. A method of integrating knowledge of data record field contexts into an interlocking trees datastore structure, whereby said field contexts remain distinguishable when said record is recorded into said interlocking trees datastore structure via association of a field identifier with each field variable in said data record, the method comprising:
- receiving said data record from a data source,including a field identifier for each field variable in said record,particlizing said record in an order such that a field identifier for each variable is included in a particle sequence corresponding to said record, andsending said particle sequence to a K Engine for recording into an elemental root node of the interlocking trees datastore structure, the interlocking trees datastore structure comprising elemental root nodes, subcomponent nodes and end-product nodes using asCase and asResult bi-directional links for determining paths within the interlocking trees datastore structure, wherein an asCase path comprises a sequence of sub-component nodes linked with bi-directional asCase links ending with an end-product node and where each sub-component node in the asCase path has a bi-directional asResult link to an elemental root node or end-product node comprising an asResult path, wherein said K Engine records said data record by creating a unique node sequence in said interlocking trees datastore structure for each first occurrence of a field identifier, field variable combination during a recording of said data record from a given data source.
12 Assignments
0 Petitions
Accused Products
Abstract
Typically, field names are saved separately from tables as metadata in modern databases. Databases did not traditionally get built into interlocking trees datastores that recorded the data as events. However, in cases where one may wish to do that, thus avoiding the need for saving separate metadata from the table data of the data base, a need was found to establish an identity for particular columns or fields when working with databases or sources of data that provide table data in field/record format. So, to build interlocking trees datastores from such records a mechanism to record such data was created, adding a column ID, preferably to each field within each record or sequence that is to be recorded. Putting the column ID or identifier is inserted into the record during particlization between each column variable. In preferred embodiments a delimiter was included between the column ID or field name and the field variable. Appropriate hardware and software systems were employed to implement the invention.
-
Citations
16 Claims
-
1. A method of integrating knowledge of data record field contexts into an interlocking trees datastore structure, whereby said field contexts remain distinguishable when said record is recorded into said interlocking trees datastore structure via association of a field identifier with each field variable in said data record, the method comprising:
-
receiving said data record from a data source, including a field identifier for each field variable in said record, particlizing said record in an order such that a field identifier for each variable is included in a particle sequence corresponding to said record, and sending said particle sequence to a K Engine for recording into an elemental root node of the interlocking trees datastore structure, the interlocking trees datastore structure comprising elemental root nodes, subcomponent nodes and end-product nodes using asCase and asResult bi-directional links for determining paths within the interlocking trees datastore structure, wherein an asCase path comprises a sequence of sub-component nodes linked with bi-directional asCase links ending with an end-product node and where each sub-component node in the asCase path has a bi-directional asResult link to an elemental root node or end-product node comprising an asResult path, wherein said K Engine records said data record by creating a unique node sequence in said interlocking trees datastore structure for each first occurrence of a field identifier, field variable combination during a recording of said data record from a given data source. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
- 15. A computer readable storage medium including digitally encoded data readable by a processing system providing a KStore stored therein, said KStore said KStore comprising a plurality of asCase and asResult paths, wherein an asCase path comprises a sequence of sub-component nodes linked with bi-directional asCase links ending with an end-product node, wherein each sub-component node in the asCase path has a bi-directional asResult link to an elemental root node or end-product node comprising an asResult path, said KStore having a quantity of sets of nodes for identifying field and field variable concatenations, each set of said nodes for identifying, identifying a given field in any record sequence and an associated field variable value, wherein each field and field variable concatenation is recorded into an elemental root node of the interlocking trees datastore structure in an interlocking trees datastore structure comprising elemental root nodes, subcomponent nodes and end-product nodes using asCase and asResult bi-directional links for determining paths within the interlocking trees datastore structure, wherein record data of the record sequence is recorded by creating a unique node sequence in said interlocking trees datastore structure for each first occurrence of a field identifier, field variable combination during a recording of said record data from a given data source.
Specification