As traditional method mining for association rules between items in large and grand data sets is inefficient. In this paper we present an efficient method called BPMRA which is based on mapreduce and partition. We have compared BPMRA algorithm based multi-node and partition based single node method and performed some experiments. It turns out that BPMRA possesses high parallelism good stability and scalability, especially suitable for mining for association rules in large and grand data sets.