检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:徐晨 顾曦华 盛银波 金军 XU Chen;GU Xi-hua;SHENG Yin-bo;JIN Jun(Jiaxing Hengchuang Power Group Co.,Ltd.,Huachuang Information Technology Branch,Jiaxing 314000,Zhejiang Province,China;State Grid Jiaxing Electric Power Supply Company,Jiaxing 314000,Zhejiang Province,China)
机构地区:[1]嘉兴恒创电力集团有限公司华创信息科技分公司,浙江嘉兴314000 [2]国网浙江嘉兴供电公司,浙江嘉兴314000
出 处:《信息技术》2023年第8期130-136,共7页Information Technology
摘 要:为避免基体的反复压缩操作,提出一种基于流量分析的XML嵌套数据流无损压缩算法。利用GDDStream算法对高相似度的XML嵌套数据流进行聚类分析,并表述成“簇中心(基体)+个体差异量”形式,分解数据流,完成一次基体压缩;仅对差异量进行压缩,极大减少对基体的反复压缩操作;利用改进LZW算法实现XML嵌套数据流无损压缩。实验结果表明,压缩后不仅数据完整性得到了保证,数据量也大幅减少,数据冗余度降低,与压缩前数据相比,压缩后数据未出现变化,说明压缩算法性能较好。In order to avoid repeated compression of the matrix,a lossless compression algorithm for XML nested data stream based on traffic analysis is proposed.The GDDStream algorithm is used to cluster the high similarity XML nested data stream,which is expressed in the form of “cluster center(matrix) + individual difference quantity”.The data stream is decomposed to complete one matrix compression.The compression towards difference quantity only could greatly reduces the repeated compression operation on the matrix,and the improved LZW algorithm could realize the lossless compression of XML nested data stream.The experiment results show that the data integrity could be guaranteed after compression and the data and the data redundancy has been reduced as well.Compared with the data before compression,the data after compression does not change,indicating that the compression algorithm has better performance.
关 键 词:流量聚类 可扩展标记语言 嵌套数据流 无损压缩 串表压缩算法
分 类 号:TP14[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49