关联规则数据结构分布重排的数据库索引算法  

Database Indexing Algorithm Based on Association Rules Data Structure Rearrangement

作　　者：陈康[1] 王丹丹[1] 

机构地区：[1]郑州财经学院信息工程学院,郑州450000

出　　处：《科技通报》2015年第10期178-180,共3页Bulletin of Science and Technology

摘　　要：数据库优化索引是实现文本数据信息智能存储和调用的关键技术,网络信息文本数据具有较大的关联规则特性,造成了数据结构类间干扰,影响数据库索引精度。传统方法采用虚拟数据分布重组数据库索引技术,文本数据库扩展查询中会出现聚类特征不一致。提出一种基于关联规则数据结构分布重排的数据库索引算法。先构建网络信息文本数据库相对关联状态系统模型与关联规则关系图,在此基础上进行数据库规则信息流的结构分布重排,挖掘关联特征,实现数据库索引算法改进。仿真结果表明,采用该算法进行文本数据库索引,提高了特征匹配效率,降低执行时间,展示了优越性能。The database index optimization is a key technology in real text data information intelligent storage and transfer, data network text has the characteristic of higher association rules, resulting in data structure class interference effects, da-tabase indexing accuracy. The traditional method of using virtual data distribution of recombinant database index technolo-gy, text database query expansion will occur in the clustering feature is not consistent. Put forward a kind of database index-ing algorithm of association rules based on data structure rearrangement. To construct the network text database system model and the relative status of association rules, based on the distribution database structure rearrangement rules of infor-mation flow, mining association characteristics, improvement of indexing algorithm. The simulation results show that, by us-ing the algorithm of text database, improve the efficiency of feature matching, reduce execution time, it shows the superior performance.

关 键 词：关联规则 数据结构 数据库 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]