Association rules mining is an important part of data mining.In order to improve the efficiency of associ-ation rules mining,an FP- Growth algorithm based on Boolean matrix and MapReduce,which is marked as BPFP,is proposed,with its time and space complexity being also analyzed.In BPFP algorithm,Hadoop framework andBoolean matrix are used to reduce the number of scans of transaction data,and twice Map- Reduce is adopted tomine frequent item sets.Experimental results on multiple data sets show that the improved FP- Growth algorithm issuperior to the original one due to its high execution efficiency and speedup.