基于最优匹配模型的数据库压缩算法

Database compression algorithm based on the optimal matching model

针对数据库中数据急速膨胀的状况,提出一种新的适用于语义压缩的数据库压缩算法——基于最优匹配的OPMC算法。算法将数据表中的属性元组分类并进行最优匹配的筛选为每类选取一个代表元组,将数据集中到最优匹配的聚类中心点上,消除相似的、冗余的数据,从而实现数据的压缩。该算法经仿真实验验证,有效改善了压缩比率,相对其他算法的压缩比率提高18%。

The data in the database and the rapid expansion of the situation and recommended the application of a new database on the semantic compression algorithms - OPMC algorithm based on optimal matching. Algorithm in the attribute data table tuple clas- sification and make the best match for each type of filter selected a representative tuple will match the data set to the optimal cluster- ing center, eliminating a similar, redundant data, thereby achieve data compression. The algorithm is verified by simulation results indeed effective in improving the compression ratio to increase 18% than other algorithms.