| 术语 | balanced tree |
| 释义 | balanced tree 平衡树 In DSM-11, a graph that represents the structure of DSM arrays. Balanced trees are drawn like a family tree with the root (name) at the top and the nodes arranged below by their depth of subscripting. All nodes with one subscript are on the first level, all nodes with two subscripts are on the second level, and so forth. This tree structure is only a logical picture of an array; it does not reflect how DSM physically stores the array. For example, the tree structure shows all nodes that point to defined data nodes. DSM does not store such pointer nodes, but does recognize their logical existence. 在DEC公司的数字标准麻省总医院公用多道程序系统(DSM)中,一种表示DSM数组结构的图 形。绘制这种平衡树时,和画族树图差不多,根部(名字)位于顶部,其往下描述的支节安排在 根部的下面用下标表示,所有带一个下标的节点为第一层,带二个下标的节点为第二层,等 等。这种树结构不过是数组的一种逻辑图,并不能反映出DSM系统是如何在物理上存放数组 的。例如,这种树结构表示出所有指向经定义节点的那些节点,DSM并不保存这类指针节点, 而的确可以辨认出它们的逻辑存在。 |
| 随便看 |
|
计算机英汉双解词典包含21137条计算机术语英汉翻译词条，基本涵盖了全部常用计算机术语的翻译及用法，是计算机学习及翻译工作的有利工具。