Such modifications of the document structure during parsing can result in a smaller memory footprint for the DOM tree, and also reduce the time spent traversing a document and modifying it in memory.
这种在解析期间修改文档结构的做法可以使 DOM树占用更少的内存，而且还可以减少在内存中遍历和修改文档时所花的时间。
Indeed SAX does not explicitly build the document tree in memory.
实际上，SAX并不在内存中显式地构建文档树。
You can reuse the tree so long as it remains in memory.
只要树还保留在内存中，您就可以重用它。
This often yields a tree structure in memory many times larger than the source XML file.
这通常会在内存中生成一个比源xml文件大许多倍的树状结构。
Saxon's result tree is not normally materialized in memory — because its nodes are always written in document order, they can be serialized as soon as they are output to the result tree.
Saxon的结果树通常不在内存中具体化——因为它的节点总是按文档顺序编写，一旦将它们输出到结果树中，就可以串行化这些节点。
Unlike tree style parsing, stream parsing does not load the entire XML document into memory.
和树解析方式不同，流解析不需要将整个文档加载到内存中。
To make life easier (and it is good practice anyway), we make sure that all data is reachable from the root of a single tree of data structures in memory.
为了让生活更容易（它总是一个很好的实践），我们必须确保所有的数据从单一数据结构书的根上是可获得的。
Perhaps the biggest research challenge is to write an XSLT processor that can operate without building the source tree in memory.
也许最大的研究挑战是编写不用在内存中构建源树就可以操作的XSLT处理器。
RXP works by building a compact in-memory tree structure of the XML document being parsed.
RXP通过为所要解析的XML文档构建一个紧凑的内存树结构而工作。
This reduces memory usage during the iteration because the stack depth is constant instead of dependent on the height of the tree.
这减少了迭代过程中的内存占用，因为堆栈深度始终保持一致，而不依赖于树的高度。
In practice, as you have seen, the result tree is not materialized in memory, so the serializer is handed the nodes of the tree one at a time in document order.
实际上，如您所见，结果树没有在内存中具体化，所以串行化器将按文档顺序一次交出树的一个节点。
Tree style parsing involves loading the entire XML document into memory.
树解析方式需要将整个XML文档加载到内存中。
DOM, for example, parses the whole document and constructs a complete document tree in memory before it returns control to the client.
比如，DOM需要解析全部文档并在内存中构造完整的文档树，然后才把控制交给客户。
Target parsing can be reasonably fast and does not generate a memory-consuming parse tree, but all events fire for all elements in the data.
目标解析可以实现合理的速度并且不会生成消耗内存的解析树，但是在数据中为所有元素触发事件。
This is an in-memory tree structure representing the XML document that was parsed.
这是表示已被解析的XML文档的内存中树结构。
The same could be said about any other API, whether it's intended for parsing XML, reading property files, or creating tree-based structures in memory.
同样的问题也适用于其他API，无论是解析xml、读取属性文件还是在内存中创建树状结构的API。
Since the user is not using a tree-based object model to access this part of the document, constructing the entire tree would lead to a waste of memory due to replication of data.
因为用户不使用基于树的对象模型来访问这部分文档，所以构造完整的树会因为数据重复而浪费内存。
The most common in-memory database index strategy is called T-tree.
最常见的内存中数据库索引策略是T -树。
Thankfully, her parents were ahead of me and assigned a tree in her memory at an arboretum, a place where we can go and picnic, and the kids can play, a thought I know Emma would have loved.
幸亏，艾玛的父母比我有先见之明，在一家植物园以她的名义捐种了一棵树———我们可以到那里去怀念她。
If you are processing a large XML data tree, keep in mind that SimpleXML loads the full XML document tree into memory before processing.
如果您处理的是一个大型的XML数据树，那么请务必注意SimpleXML在处理前是需要将整个XML文档加载到内存中的。
The LXML parse method reads the entire document and builds an in-memory tree.
lxmlparse方法读取整个文档并在内存中构建一个树。
The tree builder (module com.icl.saxon.Builder) is notified of these events, and uses them to construct an in-memory representation of the XML document.
树构建器 （模块 com.icl.saxon.Builder ）被通知这些事件，并使用它们来构造XML 文档的内存表示法。
When building an in-memory tree is not desired or practical, use an iterative parsing technique that does not rely on reading the entire source file. LXML offers two approaches.
如果构建内存树并不是必须的或并不实际，则可以使用一种迭代解析技术，这种技术不需要读取整个源树。
This tree implementation (package com.icl.saxon.tinytree) takes up far less memory and is quicker to build, at the cost of slightly slower tree navigation.
该树实现(包com . icl . saxon . tinytree)占用极少的内存，并且构建过程更迅速，但其代价是浏览树的速度会稍微慢一点。
Among Heng wave the tree person's heredity memory there is this way to the meeting?
恒波树人的遗传记忆当中是否有对会这种情况地办法呢？
Hubbub noise in the world, it seems quiet, let me to pick up the tree lost its memory.
世间的尘嚣喧扰，似乎沉寂，让我重新拾取记忆的落英。
When he said goodbye to us after a friendly chat about his good teacher's memory, he picked a mango from the leafiest tree for the two of us.
他和我们像朋友一样聊天，谈论他那种好老师才有的记忆力，分手的时候，他从最茂盛的那课树上，为我们两个各摘了一只芒果。
To cope with the problem of heap memory leak, this paper presents a dynamic memory leak check technology based on red-black tree.
实现时采用红黑树管理所分配的堆内存，理论推导和实验表明其具有较高的效率。
To cope with the problem of heap memory leak, this paper presents a dynamic memory leak check technology based on red-black tree.
实现时采用红黑树管理所分配的堆内存，理论推导和实验表明其具有较高的效率。
应用推荐