以下示例概括在将列从左边的元数据树拖入列表中时检索数据的请求流。
The following example Outlines the request flow for retrieving data when a column is dragged from the left hand metadata tree into the list.
树的每个分枝都对应于元数据的一个方面。
Each branch of the tree corresponds to a facet of the metadata.
我们将从用于显示元数据的树控件开始介绍。
然后，在后面的小节中，将了解如何使用树控件显示和选择元数据条件，从而改进文档搜索的用户界面。
Then in a later section, see how the user interface can be improved for document search by using a tree control for displaying and selecting the metadata conditions.
为了使欧洲的所有建筑学数据更便于检索，几位用户创建了一个名为“欧洲建筑学目录元数据(MetadataforArchitecturalContentinEurope)”的分类树，这幅作品成功入围十佳。
To make all of Europe's architectural data easier to access, a community of users created the winning classification tree above, titled Metadata for architectural Content in Europe.
对于树中的每个节点，都定义了一个超级链接，如果用户单击该链接，就会向Discovery发送应用一个元数据条件的信号。
For each node in the tree, define a hyperlink that, if clicked on by the user, signals to the Discovery to apply a metadata condition.
第一个修改是使用树控件替换 “Refine By”（元数据）选项的显示。
The first is to replace the display of "Refine By" (metadata) options with a tree control.
LocalEnvironment树用于存储和传播输入文件元数据。
The Local Environment tree is used for storing and propagating input file metadata.
在图象数据库的存贮结构及图象的数据压缩等应用中，GD等这类线性四元树表示方法得到了大量的研究。
In the application of image database and data compression, the linear quadtree methods such as GD are studied very much.
在这些年间，有许多种不同的数据结构不断被提出和应用，例如哈希表、二分搜索树、数字查找树、三元搜索树等等。
Throughout the years, many kinds of data structure had been proposed and applied, for instance, hash tables, binary search tree, digital search tree, ternary search tree and so on and so forth.
本文围绕查全率和查准率的效率问题，引入树匹配思想，对基于XML的元数据检索进行了深入的研究。
This thesis aims at the efficiency problem of accuracy and recall rate in XML retrieval. Based on tree matching, the thesis makes a further study on the XML retrieval technology about metadata.
该算法采用人们熟悉的树型数据结构，可以较为合理地表示稀疏校验矩阵中行与列中非零元素的跳转关系。
This algorithm used the data of tree structure, and could more reasonably the skipping relations of the non-zero elements in the rows and lines of the sparse check matrix.
该算法采用人们熟悉的树型数据结构，可以较为合理地表示稀疏校验矩阵中行与列中非零元素的跳转关系。
This algorithm used the data of tree structure, and could more reasonably the skipping relations of the non-zero elements in the rows and lines of the sparse check matrix.
应用推荐