APPQKW: An Efficient Algorithm for Processing Path Queries on the Knowledge Graph under Ecosystem

EKOLOJI(2019)

引用 0|浏览1
暂无评分
摘要
Path queries on the knowledge graph have recently received a lot of attention in artificial intelligence community. At present, most of the research works are directly based on the large-scale knowledge graph which is stored on hard disks. And they cannot effectively use the pre-stored path views to improve the processing efficiency of path queries. To tackle with this problem, in this paper, we present an efficient algorithm APPQKW (Algorithm for Processing Path Queries on the Knowledge Graph) which utilizes several path views to equivalently rewrite real-time path queries on the knowledge maps. APPQKW algorithm can efficiently overcome the three performance drawbacks of existing methods: (1) they need to perform exponential number of nesting cycles, (2) they need to produce exponential number of candidate path queries, and (3) for each candidate path query, and they need to require exponential number of equivalent matches. Moreover, we give the correctness and validity of the ACPQKW algorithm in theory, and gives detailed experiments to verify the theoretical results.
更多
查看译文
关键词
path queries,equivalent rewriting,knowledge graph,path view
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要