摘要
定义了单层BOM和多层BOM树的结构,并总结了实际运用中的多级型BOM遍历的两种基本算法:递归查找法、分层查找法.在介绍这两种算法的原理和对其速度、资源占用、实用性进行评价的基础上,提出了一种综合以上两种算法的优点,且适合普遍使用的关系型数据库存储的改进的多级型BOM遍历算法,使该改进算法包含速度快、资源占用低、实用性高的优点.同时详细介绍了此算法的软件实现,并且在实际的运用中取得了明显的效果.
The mono-layer BOM and multi-layer BOM trees are defined, and two of the basic algorithms of traversal of multilevel BOM are summarized as well,which are Recursive Search and Level Search. Based on the analysis of algorithms principles, and evaluating the calculating rate, percentage of using CPU and practicability of them, a kind of improved Traversal of multi-level BOM algorithms is proposed. It is applied in relational database with high calculating rate, lower percentage of using CPU and high applicability. The software implement of these algori-thms is also introduced in detail, and the results of its application show that these algorithms are feasible and effective.
出处
《重庆大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2005年第7期82-85,共4页
Journal of Chongqing University
基金
重庆市制造业信息化重大专项子项目"重庆青山工业有限责任公司CAD/CIMS一期工程"(2001-03)
