Abstract: Knowledge grid is analyzed comprehensively and then a grid-based MBHD (multi-strategy based hybrid distribution) algorithm is put forward in view of the heterogeneous, dynamic and distributive characteristics of grid. The optimization policy of market mechanism is integrated with timestamp mechanism and token-ring policy in MBHD algorithm to solve efficiently the problem of network load balance due to the restricted algorithms in grid and avoid the formation of unnecessary network load and competition. The time spending as a problem crucial to the algorithm for association rules mining is thus solved with the efficiency and performance improved. Testing results show the MBHD response time performance corresponding to different numbers of processor nodes and minimum support, which is compared with CD, IDD and HD algorithms. A conclusion is reached that the MBHD algorithm is highly adaptable to the characteristics of grid as a platform with its performance especially the expandability improved greatly.