With　the　rapid　development　of　information　technology,　data　grows　explosionly,　how　to　deal　with　the　large　scale　data　become　more　and　more　important.　Based　on　the　characteristics　of　RDF　data,　we　propose　to　compress　RDF　data.　We　construct　an　index　structure　called　PAR-Tree　Index,　then　base　on　the　MapReduce　parallel　computing　framework　and　the　PAR-Tree　Index　to　execute　the　query.　Experimental　results　show　that　the　algorithm　can　improve　the　efficiency　of　large　data　query.　©　(2014)　Trans　Tech　Publications,　Switzerland.