Twig query is considered the core query pattern in most XML query language. With the XML document size becoming larger, single site cannot deal with such volume data in storage capacity and compute ability. Partitioning the large data and distributed parallel processing query is an efficient and effective way. This paper proposes Twig MRR algorithm for evaluating XML twig query over large XML data that is encoded by Dewey, partitioned horizontally and distributed storage in a cluster. Twig MRR is based on MapReduce and extended a new model Map-Reduce-Reduce to get the final results for twig query. The experimental results show that our approach is scalable and efficient on this problem.