%AQu, Wenwen%AYan, Da%AGuo, Guimu%AWang, Xiaoling%AZou, Lei%AZhou, Yang%Anull Ed.%BJournal Name: Communications in computer and information science; Journal Volume: 1281 %D2020%I %JJournal Name: Communications in computer and information science; Journal Volume: 1281 %K %MOSTI ID: 10221363 %PMedium: X %TParallel Mining of Frequent Subtree Patterns %XMining frequent subtree patterns in a tree database (or, forest) is useful in domains such as bioinformatics and mining semi-structured data. We consider the problem of mining embedded subtrees in a database of rooted, labeled, and ordered trees. We compare two existing serial mining algorithms, PrefixTreeSpan and TreeMiner, and adapt them for parallel execution using PrefixFPM, our general-purpose framework for frequent pattern mining that is designed to effectively utilize the CPU cores in a multicore machine. Our experiments show that TreeMiner is faster than its successor PrefixTreeSpan when a limited number of CPU cores are used, as the total mining workloads is smaller; however, PrefixTreeSpan has a much higher speedup ratio and can beat TreeMiner when given enough CPU cores. %0Journal Article