Optimizing the size of an interlocking tree datastore structure for KStore
View Patent ↗A method for optimizing the construction of a KStore includes providing a data set having a plurality of records with a plurality of fields, providing an optimization structure from a sample of the data set and analyzing the optimization structure to determine a field order for the records contained in the data set. A KStore is provided from the data set in accordance with the field order. The sample of the data set can include the entire data set, a random sample of the data set or a predetermined number of records from the data set. The data set has an initial order having earlier records and later records and the sample can include a plurality of the earlier records. The sample of the data set includes a user determined number of records from the data set. The optimization structure can be a KStore.
1. A method for optimizing construction of a KStore interlocking tree data store, comprising:
providing a data set having a plurality of records with a plurality of fields;
providing an optimization structure from a sample of said data set;
analyzing said optimization structure to determine a field order for said plurality of records contained in said data set, wherein said analyzing of said optimization structure comprises obtaining analysis data from said optimization structure and providing a data structure to contain said analysis data;
providing a KStore interlocking tree data store from said data set in accordance with said field order;
recording a variable in said data structure representative of a number of differing field values in a field; and
recording a plurality of variables in said data structure, each variable of said plurality of variables being representative of a number of differing field values in a respective field of said plurality of fields, wherein said fields of said plurality of fields have an initial order of fields within a record of said plurality of records further comprising determining a further order of fields differing from said initial order of fields in accordance with said plurality of variables.
2. The method for optimizing the construction of a KStore interlocking tree data store of claim 1 , further comprising determining said further order of fields in accordance with magnitudes of respective variables of said plurality of variables.
3. The method for optimizing the construction of a KStore interlocking tree data store of claim 1 , further comprising ordering said fields of said plurality of fields from a smallest magnitude to a largest magnitude of said respective variables of said plurality of variables.
4. The method for optimizing the construction of a KStore interlocking tree data store of claim 1 , wherein providing said KStore comprises loading the fields of a record of said plurality of records into said KStore interlocking tree data store in said further order.
5. The method for optimizing the construction of a KStore interlocking tree data store of claim 1 , wherein said further order is saved for use in relearning said data set.
6. The method for optimizing the construction of a KStore interlocking tree data store of claim 5 , wherein providing said KStore interlocking tree data store comprises loading said plurality of fields of a record of said plurality of records into said KStore interlocking tree data store in said further order.