利用关系运算建立信息目录树的算法研究

为了解决快速建立信息目录树的问题,提出了利用关系运算生成树结点的算法,给出了结点表关系模式,阐述了算法的实现过程。解决了树的深度可扩展,度不受限制,保证高运算效率等问题。并深入解析了结点编号的获取方法,子结点与父结点的关联技术等关键技术。算法适用于层次结构关系的信息组织和检索,其有效性已在相关应用系统开发中得到验证。

Relations theory used to create the information directory tree algorithm

In order to build information directory tree rapidly, this paper proposed an algorithm which create tree node structure according to the relation＇s operation, presented relation pattern for nodes table, and demonstrated the implement procedure about this algorithm. Using these methods, some issues include the expansivity of tree depth, the unrestricted of tree out-degree and calculating efficiency, were resolved perfectly. Meanwhile, the key issues such as the method of node numbering and the technology about association between parent node and son node, were discussed thoroughly. The algorithm proposed is suit to the organizing and searching for information which with hiberarchy structure, and the validity of algorithm was proved in the real application.