机构地区: 华中理工大学管理学院
出 处: 《计算机工程与应用》 1999年第4期39-41,共3页
摘 要: 基于关系数据库软件开发的管理信息系统,数据库文件用二维表表示实体之间的联系,常采用顺序存储结构。在MRP中,由于产品结构文件的这种存储结构,层次码计算非常不便。该文从产品结构文件在二维表中特定的存储特征出发,结合链表的相似之处,将二维表虚拟成链表结构,然后采用树的遍历原理,通过递归调用实现层次码计算。 Based on DBMS of relation database,the Data structure of relation database often adopt the appenanceof two-dimension array and the storage in order.But due to the order form of BOM,it is difficult to caculate level code in MRP.Starting from the particular content characters of BOM and combining similarity of bindary list,this paper forges the structure of linked list,then uses the principle of visiting tree to calculate the level codethrough recursive transfering.