Relational Database Compression for Similar Data Sets

A new definition of similar data set is proposed for some special data sets which have the same attributes in a relational database model.For compression of a single data set,the database normalization is performed by partitioning the relations;for multiplet similar data sets,a data lossless compression algorithm is proposed,which is based on a 0-1 status tag sequence.With the compression method,redundancies among similar data sets evidently decrease,and decompression finishe fast and completely.Experimental results show that with the method compression on similar data sets is efficient without any loss and access to the data is fast.