Abstract: With the emergence of semantic web technologies and knowledge maps, most of the current query models require semantic matching between query results and user queries. The simple query process can not meet the user’s query requirements. Therefore, the rewriting techniques and implementation methods involved in knowledge graph query are studied. On the basis of defining the rewrite rule set of SPARQL(SPARQL Protocol and RDF Query Language) query mode, the SPARQL is rewritten by Prolog. In the distributed data storage environment, through the test analysis of the experimental data of LUBM(Lehigh University Benchmark), it is found that the rewritten query can mine more semantic information in the knowledge map than the original query.

Key words: knowledge graph, ontology, SPARQL protocol and RDF query language ( SPARQL );query rewriting