文档介绍：计算撬骚究与发爱 ISSN 1000— 11—1777[TP Journal puter Research and Development 50(Suppl.):94—102,2013 StepMatch:一种基于BSP计算模型的SPARQL基本图模式匹配算法各雪栋冯患勇王鑫饶国政付字新(天津大学计算机科学与技术学院天津300072) (天津枣认知计算与应蘑蘩点实验室天津300072) (1xd.******@) StepMatch--An Algorithm Handling SPARQL Basic Graph Pattern Based on BSP Model L疆Xuedong,Feng Zhiyong,Wang Xin,Rao Guozheng,and Fu Yuxin (School puter Science and Technology,Tianjin University,Tianjin 300072) (Tia可in Key Laboratory of puting and Application,Tianjin 300072) Abstract With the development ofthe semantic and more data iSpublished in resource description framework(RDF).There are many studies processing RDF data with MapReduce,while iterative MapReduce is not thebest choice forRDF algorithm often better fit amessage passing this paper,an algorithm named StepMatch based on BSP model ispresented processing SPARQL basic graph pattern。StepMatch algorithm isvertex- vertex inRDF graph putation unit and can perform calculations and send messages to other agiven SPARQL query,the number ofsupersteps islinearly correlated with thenumber oftriple patterns that theSPARQL query containing。In thispaper,we make use ofApache Hama to implement StepMatch (Lehigh University Benchmark)and DBpedia data are used to carry out the experiment. Key words bulk synchronous parallel(BSP)model;message passing;basic