计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (14): 149-151.
• 数据库、信号与信息处理 • 上一篇 下一篇
陈秋阳，金连甫
收稿日期:
修回日期:
出版日期:
发布日期:
CHEN Qiuyang，JIN Lianfu
Received:
Revised:
Online:
Published:
摘要： 针对关联规则快速更新算法（PFUP）会带来单处理机运行负荷过重、降低执行效率的问题，提出基于并行计算快速更新算法（PPFUP）。在无共享的工作站上，通过划分局部频繁项集并分配到结点，采用并行思想处理原数据库和新增数据库的计算任务，降低单处理机内存压力。实验证明了该算法的有效性。
关键词: 关联规则, 基于并行计算快速更新（PPFUP）算法, 并行计算, 快速剪枝更新（PFUP）算法
Abstract: Pruning and Fast Updating algorithm（PFUP） always overloads the processor and decreases executing efficiency.An improved Parallel，Pruning and Fast Updating（PPFUP） algorithm is presented to solve these problems of PFUP.PPFUP algorithm based on shared-nothing workstations，partitions the locally-large itemsets and assigns them to different workstations，and synchronizes the tasks of computing on two databases to reduce the stress of memory.Simulation shows that the execution time of PPFUP algorithm reduces to 11% compared with PFUP algorithm in the case of the same database and low support threshold.
Key words: association rule, Parallel and Pruning and Fast Updating（PPFUP） algorithm, parallel computation, Pruning and Fast Updating（PFUP） algorithm
陈秋阳，金连甫. 并行的关联规则增量式更新优化算法研究[J]. 计算机工程与应用, 2011, 47(14): 149-151.
CHEN Qiuyang，JIN Lianfu. Research on optimization of parallel incremental updating algorithm for association rules[J]. Computer Engineering and Applications, 2011, 47(14): 149-151.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2011/V47/I14/149
