In this paper, we offer a segmented query executive plan which is based on bushy tree model.
该文以丛生树模型为基础，提出了一种片段式查询执行计划。
Based on the research of unordered tree-inclusion matching, a matching algorithm for XML-based component query is proposed.
在研究无序树包含匹配的基础上，提出一种新的基于XML的软件构件查询匹配算法。
The article designs a kind of SPDB organization based on key tree and corresponding query algorithm, which makes average query length shorten a lot.
该文设计了一种基于键树思想的SPDB组织方式和相应的查找算法，使平均查找长度大为缩短。
And a structure of priority tree is proposed in order to realize the unique execution sequence of the query based on priority.
并给出了一种优先级树结构，使得基于优先级的查询执行序列唯一化。
And a structure of priority tree is proposed in order to realize the unique execution sequence of the query based on priority.
并给出了一种优先级树结构，使得基于优先级的查询执行序列唯一化。
应用推荐