A variation of Aho-Corasick algorithm via compact storage was presented, which replaced homogeneous rou-tine explicit storage with heterogeneous requirement oriented implicit one, first started from two aspects of widthwise fan-out compression and lengthwise path compression, then expanded around the compression of sparse event table, thus reduced memory usage to about 0.

Based on the MOLAP technology of multi-dimension array,the article proposes a new method of compressed store,which was stored in dimensions by binary code.

Explains the compression storage of the OpenOffice.

The author has,through the combination of sparse matrix compression storage and the characteristics of C/C++ language, produced an improved sparse matrix compression storage method,binary compression storage method,which stores the nonezero elements in the sparse matrix into a sequence list by way of binary scale.

The paper analyzes compress storage of large coefficient matrix which realizes 1D chain compress storage of coefficient matrix by combination of array and structure.