摘要
XML文档中相当大的部分由标记组成,用起始和结束元素标识符描述文档的树结构.本文重点研究了XML文档树结构的压缩算法,比较了各种编码方法与树结构中包含的节点数目和模型规模之间的关系.提出了有效的XML树结构压缩算法,实验结果表明,这种算法对于内部片段多次重复出现的XML树结构特别有效.
In an XML document a considerable fraction consists of markup,using begin and end-element tags describing the document＇s tree structure.In this paper,the compression algorithms for XML tree structure have been emphatically researched,and compared relationships of different coding technique with the number of nodes in tree structure and size of pattern.Experimental results show that the algorithm is especially effective for XML tree structure of the repetition of tree patterns.
出处
《安徽师范大学学报（自然科学版）》
CAS
北大核心
2011年第1期33-37,共5页
Journal of Anhui Normal University(Natural Science)
基金
安徽省自然科学研究项目(KJ2010B280)
关键词
结构压缩
非排列树
DAG
SLT
structure compression
unranked tree
directed acyclic graph
straight-line tree
