基于十字链表与三元组表的稀疏矩阵压缩存储实例研究

Study on the Compressed Storage to Sparse Matrix Based on Cross List and Triple Table

十字链表和带行链接信息的三元组表是稀疏矩阵的两种压缩存储方法。十字链表为链式存储结构,带行链接信息的三元组表为顺序存储结构。在MovieLens数据集上设计了分别采用十字链表和带行链接信息的三元组表对以用户为行、项目为列、用户评分为矩阵元的稀疏矩阵进行压缩存储,并在这两种存储结构上实现用户相似度计算算法。通过测试分析和比较了两种不同的压缩存储方法在创建及相似度计算上的执行效率,并探讨了各自的特点及适用条件。

The storage structures of cross list and triple table are both effective methods of compressed storage.Based on the data set of MovieLens,algorithms of compressed storage to sparse matrix for similarity computation of users are implemented in this work.The execution efficiency of both storage structures on the creation and implementation are analyzed according to the test.Besides,the characteristics and validity of the two storage structures are discussed.