Mining high utility itemsets (HUIs) has been developing in recent years. However, the methods of mining from distributed databases have not mentioned yet. In this paper, we present a parallel method for mining HUIs in vertically partitioned distributed databases. We use WIT-tree structure to store local database on each site for parallel mining HUIs. The item i
in each SlaverSite is only sent to MasterSite if its Transaction-Weighted Utilization (TWU) satisfies minutility (minutil), and MasterSite only mines HUIs which exist at least on 2 sites. Besides, the parallel performance is also interesting because it reduces the waiting time of attended sites. Thus, the mining time is reduced more significant than that in mining from centralized database.