摘要
数据库中多个实体呈树形关联时,对海量数据作多层实体连接运算时要消耗系统大量的内存资源。本文提出了一种“超”实体的概念,给出其数据结构。描述了“超”实体在C/S模式下的树形结构构造算法和在B/S模式下的无限层次动态下拉列表构造算法,并结合具体的系统给出了主要代码。实例证明,这种实体构造方法在信息系统的海量数据检索中是高效可行的。
Vast memory resource is consumed when great capacity data is retrieved while many layers of entities in a database are related like a tree and join operation is carried out.The paper brings forth the concept of Super-Entity, and data structure is also given. A Construction algorithm of super-entity based on tree data structure is presented and a way of dynamic dropdown listbox with infinite layers is put forward by combining an information system.Analysis to instance shows that the entity construction way is efficient and feasible when used in retrieving great capacity data.
出处
《微计算机信息》
北大核心
2006年第11X期215-217,255,共4页
Control & Automation
基金
国家"863"高科技项目(2003AA414011)
湖北省教育厅科学研究计划项目(B200511008)