.png){kind=icon}
返回
Efficient memory representation of XML document trees
.png){kind=icon}
OA
AI
DOI：10.1016/j.is.2008.01.004.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times larger than the size of the document. A considerable amount of memory is needed to store the tree structure of the XML document. In this paper, a technique is presented that allows to represent the tree structure of an XML document in an efficient way. The representation exploits the high regularity in XML documents by compressing their tree structure; the latter means to detect and remove repetitions of tree patterns. Formally, context-free tree grammars that generate only a single tree are used for tree compression. The functionality of basic tree operations, like traversal along edges, is preserved under this compressed representation. This allows to directly execute queries (and in particular, bulk operations) without prior decompression. The complexity of certain computational problems like validation against XML types or testing equality is investigated for compressed input trees. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
tree grammar
compression
in-memory XML representation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
2.8K
被引数:
1.8K
机构
引用论文
.png){kind=icon}
Does Top-Down, Standards-Based Reform Work? A Review of the Status of Statewide Standards- Based Reform自上而下、基于标准的改革有效吗？——对全州范围内基于标准的改革现状的综述
PREAI
分享收藏Predicting Reading Problems at Kindergarten for Children in Second Grade: SEARCH as a Screen预测幼儿园儿童在二年级时的阅读问题：SEARCH 作为筛查工具
PREAI
分享收藏分享收藏分享收藏 没有更多内容
没有更多内容