arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2002.03686cs.DBcs.AI
收藏

大规模知识图谱上的检索算法优化

Optimization of Retrieval Algorithms on Large Scale Knowledge Graphs

Fraunhofer Institute for Algorithms and Scientific Computing SCAI(弗劳恩霍夫算法与科学计算研究所SCAI)

Jens Dörpinghaus, Andreas Stefan

AI总结:

针对大规模标签属性图检索算法优化不足的问题,提出两种优化方法及问题复杂度分类模式,在含71M+节点、850M+关系的生物医学知识图谱上实现44至3839倍的速度提升。

摘要:

知识图谱已被证实在近年的知识挖掘与发现中发挥着重要作用,例如在生命科学或生物信息学领域。尽管在查询优化、查询转换,当然还有大规模知识图谱的存储与检索领域已有大量研究,但算法优化领域仍是一大挑战,也是使用图数据库的关键因素。鲜有研究者针对大规模标签属性图上的算法优化问题展开研究。在此,我们提出两种优化方法,并将它们与直接查询图数据库的朴素方法进行对比。我们的工作旨在确定Neo4j这类图数据库的限制因素,并提出一种应对这些挑战的新方案。为此,我们提出了一种分类模式,用于区分图数据库上问题的复杂度。我们在一个测试系统上评估所提的优化方法,该系统包含一个由生物医学出版物数据衍生、并经文本挖掘数据丰富的知识图谱。这个稠密图谱拥有超过7100万个节点和8.5亿条关系。实验结果十分鼓舞人心——根据问题的不同,我们实现了44到3839倍的速度提升。

英文摘要:

Knowledge graphs have been shown to play an important role in recent knowledge mining and discovery, for example in the field of life sciences or bioinformatics. Although a lot of research has been done on the field of query optimization, query transformation and of course in storing and retrieving large scale knowledge graphs the field of algorithmic optimization is still a major challenge and a vital factor in using graph databases. Few researchers have addressed the problem of optimizing algorithms on large scale labeled property graphs. Here, we present two optimization approaches and compare them with a naive approach of directly querying the graph database. The aim of our work is to determine limiting factors of graph databases like Neo4j and we describe a novel solution to tackle these challenges. For this, we suggest a classification schema to differ between the complexity of a problem on a graph database. We evaluate our optimization approaches on a test system containing a knowledge graph derived biomedical publication data enriched with text mining data. This dense graph has more than 71M nodes and 850M relationships. The results are very encouraging and - depending on the problem - we were able to show a speedup of a factor between 44 and 3839.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑