So to construct a nonblocking linked list, tree, or hash table, we need to find a way to update multiple Pointers with CAS without leaving the data structure in an inconsistent state.
所以，要构建一个非阻塞的链表、树或哈希表，需要找到一种方式，可以用CAS更新多个指针，同时不会让数据结构处于不一致的状态。
A DataGraph object represents data in a tree-like structure, with a root object at the top of the tree and children under it, similar to the structure that you might find in an XML document.
DataGraph对象以类似于树的形式表示数据，树的顶部是根对象，其下面为各个子项，与您在XML文档中看到的结构类似。
Data binding converts these XML trees to and from trees of objects (or sometimes graphs of objects, with links up or across the tree structure).
数据绑定使xml树和对象树(或者有时候是对象图，带有向上或跨整个树结构的链接)相互转换。
A new unstructured Cartesian cutted grid generation method is introduced. The grid generation of some airfoils and wing is performed with the tree data structure.
描述了一种新的网格生成技术，即笛卡尔非结构切割网格技术，采用叉树数据结构，完成了几种单段和多段翼型以及三维机翼的网格生成。
A binary tree is a data structure with nodes that include no more than two linked nodes.
二叉树是一个具有节点的数据结构，其每个节点最多包含两个子节点。
For better analysis of the optimized methods for the data transfer, the multi-module system is abstracted to the tree structure with weighted edges.
为了更好地分析如何寻找一个最佳的传送方法，将整个多模块系统抽象成一个边带权值的树结构。
But can we make it more efficient in time with a tolerable space increment? We need to analyse the algorithm and the data structure of ternary search tree.
但是我们能在可容忍的空间使用增加上，进一步提高它的时间效率吗？我们需要分析三元搜素树的算法与结构。
DICOM Nesting Data Set is a kind of complex Data Set with a tree structure, and is widely used in DICOM services and encoding of DICOM files for its special structure.
由于其结构的灵活性，被广泛应用于各种DICOM服务类的数据交互以及DICOM文件的编码中。
The design USES hierarchical design method, with the use of chain and tree data structure to achieve the FAT file system. It has well maintainability and portability.
本设计采用层次化设计，运用链表与树形数据结构实现FAT文件系统，具有较高的可维护性与可移植性。
CART decision tree has outstanding advantages on the issue of classification in dealing with multi-dimensional data with complex structure.
决策树能实现快速分类，CART决策树在处理复杂结构的多维数据分类问题上具有突出优势。
In addition to T-linked tree, the paper devises a set of arithmetic for data processing with a special data structure, which can enhance synchronous process ability of readers.
在T链表树结构基础上，本文还设计了一套数据处理算法，结合特殊的数据结构，可以极大的提高读写器的实时数据处理能力。
Obviously, it is more convenient to build and maintain the knowledge base compared with the tree data structure.
采用以上方法建造的知识库更为简洁，维护也更为方便。
Obviously, it is more convenient to build and maintain the knowledge base compared with the tree data structure.
采用以上方法建造的知识库更为简洁，维护也更为方便。
应用推荐