| 基于关系表示的树数据结构的实现 |
| |
| 引用本文： | 黄冬泉,张敏.基于关系表示的树数据结构的实现[J].徐州师范大学学报(自然科学版),1999(2). |
| |
| 作者姓名： | 黄冬泉 张敏 |
| |
| 作者单位： | 空军后勤学院计算中心 |
| |
| 摘 要： | 用关系数据库存储和表示的树数据结构能使信息系统准确地描述数据之间的关系，同时能以一致的方法表示和处理层次和关系数据，有利于信息系统构造以及实现更友善的用户接口．本文以关系数据集为基础定义了一种关系树，提出了树结构在关系数据集上的存储方案，讨论了关系树一般性计算的实现方法，如树的建立、结点访问、插入、删除和遍历等
|
| 关 键 词： | 关系数据模型 树 |
The Implementation of Tree Data Structure Based on Relational Representation |
| |
| Author HUANG Dongquan,ZHANG Min.The Implementation of Tree Data Structure Based on Relational Representation[J].Journal of Xuzhou Normal University(Natural Science Edition),1999(2). |
| |
| Authors: | Author HUANG Dongquan ZHANG Min |
| |
| Abstract: | The tree data structure stored and represented in a relational database makes the information system accurate in describing the relations of data and identical in representing and processing the treelike or relational data. This facilitates building up the information system and implementing of more friendly user interface. This paper defines a relational tree on the basis of relational data set, gives a storing scheme of a tree on the set and discusses the implementation methods of some typical tree computing such as tree creating, node accessing, inserting, deleting and tree traversing. |
| |
| Keywords: | relational data model tree representation of tree storage computing on the tree |
| 本文献已被 CNKI 等数据库收录！ |
