[1]任军员.用Hash表实现树的压缩存贮[J].郑州大学学报(工学版),1995,16(01):84-87.
Member.Use the HASH form to achieve the compression of the tree storage[J].Journal of Zhengzhou University (Engineering Science),1995,16(01):84-87.
点击复制
用Hash表实现树的压缩存贮(
)
《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]
- 卷:
-
16
- 期数:
-
1995年01期
- 页码:
-
84-87
- 栏目:
-
- 出版日期:
-
1995-01-28
文章信息/Info
- Title:
-
Use the HASH form to achieve the compression of the tree storage
- 作者:
-
任军员
-
郑州工学院土木建筑工程系
- Author(s):
-
Member
-
The Department of Civil Construction Engineering, Zhengzhou Institute of Technology
-
- 关键词:
-
压缩杂凑; 杂凑树; 树结构
- Keywords:
-
Compression hybrid; hybrid tree; tree structure
- 文献标志码:
-
A
- 摘要:
-
本文探讨了如何使用杂凑表以一种非常压缩的形式实现树的存贮。使用这种方法，任意树中的指针均能以每个结点６＋ｌｏｇ２ｎ比特表示（这里ｎ是一个结点所能有的最大孩子数目）．从而在存贮大型的树时，使所需的存贮容量能显著地减少。
- Abstract:
-
This article discusses how to use the miscellaneous table in a very compressed form to realize the storage of trees. Using this method, the pointers in any tree can be represented by each node 6 + LOG2N Bit (here n is the largest number of children can have a node). So as to store large trees, the required storage capacity can be significantly reduced.
更新日期/Last Update:
1900-01-01