Finding all occurrences of a twig pattern in an XML document is a core operation for XML query processing. Many holistic twig join algorithms have been proposed to match XML twig pattern. Most of these algorithms find twig pattern matching in two phases. In the first phase, a query tree is decomposed into smaller pieces, and solutions against these pieces are found. In the second phase, all of these partial solutions are joined together to generate the final solutions. In this paper, we propose a novel holistic twig join algorithm, called TwigStack++, which features two main improvements in the decomposition and matching phase. Experimental results on various datasets show that our algorithm outperforms the existing approaches.