Patent ID: 9727572
Date: 2017-08-08
CPC Classifications: G06F,H03M

Claim:
1. A database compression system comprising at least one processor and at least one memory, the at least one memory being configured, with the at least one processor, to: analyze a schema of a database by maintaining a list of attributes and corresponding values and analyze a selection of entries in the database; determine a frequency of occurrence of each attribute/value pair in the selection of entries in the database; generate a data structure comprising a plurality of levels, wherein each level represents a different one of the attributes, wherein a highest level in the data structure comprises a node representing the attribute/value pair having the highest frequency of occurrence in the selection of entries in the database, and wherein each subsequent level in the data structure comprises a node representing an attribute/value pair having a frequency of occurrence in the selection of entries in the database that is the same as, or the next highest to, the highest frequency of occurrence in the selection of entries in the database of an attribute/value pair in the level above; determine which combinations of attribute/value pairs spans all of the levels of the data structure; determine a frequency at which each of the combinations of attribute/value pairs that span all levels of the data structure occur in combination in the selection of entries in the database; determine which combination of attribute/value pairs that spans all of the levels of the data structure occurs in combination in the selection of entries in the database with the highest frequency; assign a condensed code to a character string that comprises the combination of attribute/value pairs that spans all of the levels of the data structure and occurs in combination in the selection of entries in the database with the highest frequency; and compress the database by replacing the character string with the condensed code.