| Summary: | 碩士 === 國立中正大學 === 資訊管理所暨醫療資訊管理所 === 97 === In this paper, we proposed a novel algorithm which is implemented on the distributed system that can efficiently solve the problem of FP-tree.
The algorithm uses divide and conquer to split big database into several sub-database. With data division, the algorithm can reduce the total execution time of algorithm. The algorithm doesn’t construct the whole FP-tree. Instead, with intermittence, a time division mechanism, the algorithm can also efficiently reduce the execution time. We also compress the data into a one dimensional array while transmitting, which can reduce the communication cost.
|
|---|
