1) linear-bushy-tree
线性浓密树
2) bushy join tree
浓密连接树
1.
For the join operator that is the most difficult to process and optimize in DBMS,the query optimization strategies, based on genetic algorithms, over the plan collections of left-deep join tree and the plan collections of bushy join tree are discussed.
介绍基本遗传算法的基本思想和工作流程,针对数据库管理系统中最难处理和优化的连接操作,讨论在左深连接树的计划集合和浓密连接树的计划集合上的基于遗传算法的查询优化策略。
3) Enhanced Bush Tree
增强浓密树算法
4) a heavily foliaged tree
叶子浓密的树
5) linear hypertree
线性超树
1.
By using bipartite tree special property to depict the vertices and edges of linear hypertree,the authors obtain the counting formula and a series inferences of the linear hypertree isolated vertices,thus further the relation of degree sequence and linear hypertree are given.
在先通过引入线性超树的对应二部树的特殊对应性质来刻划超树的顶点与超边的结构,得出了线性超树的孤立点数目的计算公式和一系列推论,从而进一步揭示了度序列与线性超树的关系。
6) linear tree
线性树
补充资料：钒浸出浓密装置外貌(峨嵋铁合金厂)
钒浸出浓密装置外貌(峨嵋铁合金厂)
钒浸出浓密装置外貌(峨嵋铁合金厂)
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条