Summary RDF knowledge graphs (KG) usually contain billions of labeled entities, and how to obtain the desired results efficiently on RDF KG for given SPARQL queries have attracted increasing attentions recently. However, it is difficult for users to write a complex SPARQL query without full knowledge of the underlying KG schema due to the “schema‐free” feature of RDF KG. In this paper, we study the problem of acquiring semantic approximate results for a simple SPARQL query instead of the complex expression. The basic idea behind is to use the real knowledge semantics to extend the query intention of given simplified SPARQL query, and then a semantic based greedy search over is designed to return top‐k similar results. To obtain the knowledge semantics efficiently, we define type similarity to reorganize the original KG as a corpus with semantic locality and then a context aware text embedding model is adopted to achieve the semantic vectors of existing knowledge. Afterwards, an approximate query method over RDF KG is designed to obtain top‐k similar results based on the knowledge semantics above. Extensive experiments over DBpedia dataset and QALD‐4 benchmark confirm our solution's superiority on both effectiveness and efficiency.

No abstract