基于关系数据库表树的数据结构研究

随着关系数据库技术的应用越来越广泛,利用关系表格、关系代数、结构化查询语言等研究基于外存储结构的数据结构有着实际的意义。本文从一个具有树结构的学校管理模型出发,提出一种用关系数据库表来表示树的方法,讨论了如何利用关系代数和SQL语言对表格进行一般查询,借助JaVa语言实现二叉树中比较典型的前序、中序和后序算法,最后对文章开始引出的问题给出了实现程序。

Tree''''s data structure based on the table of relational database

Due to more and more relational database technology's applications, studying external data structure through relational algebra or SQL has its practical significance. This paper deals with not only a tree' s external data structure based on relational database' s table, but also query method through relational algebra or structured query language.(SQL) Then the algorithm of traversing the binary tree, including preorder, inorder and postorder, in Java language has been implemented. Binary trees are often used for sorting information: each node of the binary search tree contains a key, with values less than that key added to one subtree and values greater than that key added to the other. Finally, the paper solves the practical problem mentioned at the beginning.