XML Compression via Directed Acyclic Graphs
XML Compression via Directed Acyclic Graphs
复制标题
通过有向无环图进行 XML 压缩
DOI:
10.1007/s00224-014-9544-x
复制
发表时间:
2014
影响因子:
0.5
通讯作者:
E. Noeth
中科院分区:
文献类型:
--
作者:
M. Bousquet-Mélou;M. Lohrey;S. Maneth;E. Noeth
Unranked node-labeled trees can be represented using their minimal dag (directed acyclic graph). For XML this achieves high compression ratios due to their repetitive mark up. Unranked trees are often represented through first child/next sibling (fcns) encoded binary trees. We study the difference in size (= number of edges) of minimal dag versus minimal dag of the fcns encoded binary tree. One main finding is that the size of the dag of the binary tree can never be smaller than the square root of the size of the minimal dag, and that there are examples that match this bound. We introduce a new combined structure, thehybrid dag, which is guaranteed to be smaller than (or equal in size to) both dags. Interestingly, we find through experiments that last child/previous sibling encodings are much better for XML compression via dags, than fcns encodings. We determine the average sizes of unranked and binary dags over a given set of labels (under uniform distribution) in terms of their exact generating functions, and in terms of their asymptotical behavior.
登录
查看更多内容
DOI:
--
发表时间:
2001
期刊:
International Workshop/Symposium on Database Programming Languages
影响因子:
--
作者:
Dan Suciu
通讯作者:
Dan Suciu
影响因子:
3.7
作者:
Lohrey, Markus;Maneth, Sebastian;Mennicke, Roy
通讯作者:
Mennicke, Roy
影响因子:
0.8
作者:
N. Dershowitz;S. Zaks
通讯作者:
S. Zaks
DOI:
--
发表时间:
2007
期刊:
Journal of computer and system sciences (Print)
影响因子:
--
作者:
T. Schwentick
通讯作者:
T. Schwentick
DOI:
--
发表时间:
2004
期刊:
Random Struct. Algorithms
影响因子:
--
作者:
J. Marckert
通讯作者:
J. Marckert