吉林大学学报(信息科学版) ›› 2021, Vol. 39 ›› Issue (1): 87-93.

• • 上一篇    下一篇

基于知识图谱的查询语句重写机制及方法

刘思培1, 蔡一凡2, 曹玲玲1, 侯海婷1, 鲍家坤1, 袁 鸯1   

  1. 1. 北方信息控制研究院集团有限公司 总体部, 南京 211111; 2. 吉林大学 软件学院,长春 130012
  • 收稿日期:2019-11-28 出版日期:2021-03-19 发布日期:2021-03-22
  • 作者简介:刘思培(1981— ),男,安徽宿州人,北方信息控制研究院集团有限公司高级工程师,博士,主要从事军事信息系统总体技术研究,(Tel)86-13404143621(E-mail)lsp_jlu@163.com
  • 基金资助:
    装备发展部“十三五冶国家高科技共性基础预研课题基金资助项目(31510040201)

Mechanism and Method of Query Rewriting for Knowledge Graph

LIU Sipei1, CAI Yifan2, CAO Lingling1, HOU Haiting1, BAO Jiakun1, YUAN Yang1   

  1. 1. Overall Department, North Information Control Research Acdemy Group Company Limited, Nanjing 211111, China;2. College of Software, Jilin University, Changchun 130012, China
  • Received:2019-11-28 Online:2021-03-19 Published:2021-03-22

摘要: 随着语义 Web 技术和知识图谱的出现, 目前查询模式大多要求查询结果与用户查询进行语义级匹配,简单的查询处理过程已经不能满足用户的查询需求。 为此, 对知识图谱查询涉及的重写技术和实现方法进行了研究, 在定义 SPARQL( SPARQL Protocol and RDF Query Language) 查询模式的重写规则集合基础上,利用Prolog逻辑程序对 SPARQL 查询语句进行了重写实现。 在分布式数据存储环境下, 通过对 LUBM( Lehigh University Benchmark)实验数据的测试分析证实, 相比原查询语句, 重写后的查询语句能挖掘出知识图谱中更多的语义信息。

关键词: 知识图谱, 本体, SPARQL 查询语言, 查询重写

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

中图分类号: 

  • TP181