The choices for mining of decentralized data are numerous, and we have developed techniques to enumerate and optimize decentralized frequent itemset counting. In this paper, we introduce our heuristic approach to improve the performance of such techniques developed in ways similar to query processing in database systems. We also describe empirical results that validate our heuristic techniques. 1