关键词: 网格, 分布式数据挖掘, 频繁模式, 关联规则, FP-树

Abstract: For FP-tree constructing and merging based on distributed computing platform，a distributed algorithm of constructing FP-tree（GridDBMA） is presented based on the grid.At first，the global item head table is made，then the local frequent pattern tree（BFP-tree） is constructed independently according to the order of the item head table in each node.The merge-
algorithm is used to unite the local frequent pattern trees into a global tree，which can extract the global frequent item sets.Through improving the traditional storage structures of frequent pattern tree，the size of the tree and the communication between nodes are reduced，the traversal of tree is more convenient and effective，and the mining efficiency of frequent item sets is improved.The experiments show the validity and effectiveness of the algorithm by using star spectral data set.

Key words: grid, distributed data mining, frequent pattern, association rule, FP-tree