（6）有序树(OrderedTree)和无序树(UnoderedTree) 若将树中每个结点的各子树看成是从左到右有次序的(即不能互换)，则称该树为有序树；否则称为无序树。
基于28个网页-相关网页
否则称为无序树 UnoderedTree
Firstly, XML document is represented as a directional labeled unordered tree, the schema is a frequent sub-tree extracted from the tree which represents XML document.
该方法使用了有向标记无序树来表示XML文档，从中抽取出频繁子树作为模式，并用树型模式来描述它。
参考来源 - 约束满足及其分布式求解和应用研究·2,447,543篇论文数据，部分数据来源于NoteExpress
在研究无序树包含匹配的基础上，提出一种新的基于XML的软件构件查询匹配算法。
Based on the research of unordered tree-inclusion matching, a matching algorithm for XML-based component query is proposed.
它们可以表示为有序的向量、无序的组、链表、树、图或编程语言支持的其他形式。
They can be expressed as ordered vectors, unordered groups, linked lists, trees, graphs or other forms that the programming language supports.
提出了基于无序标签树匹配和结构图搜索的组件检索与匹配策略，并实现了一个组件库管理系统模型。
A kind of component matching model based on the unordered label tree-inclusion matching and Struct Graph (S-Graph) searching model is proposed. A components management system model is also realized.
应用推荐