Fraunhofer-Gesellschaft

Publica

Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Optimization of Retrieval Algorithms on Large Scale Knowledge Graphs

 
: Dörpinghaus, J.; Stefan, A.

:

Ganzha, M. ; Institute of Electrical and Electronics Engineers -IEEE-; Polish Information Processing Society -PTI-:
15th Federated Conference on Computer Science and Information Systems, FedCSIS 2020. Proceedings : September 6-9, 2020, Sofia, Bulgaria
Piscataway, NJ: IEEE, 2020 (Annals of Computer Science and Information Systems 21)
ISBN: 978-83-955416-7-4
ISBN: 978-83-955416-8-1
ISBN: 978-83-955416-9-8
ISBN: 978-1-7281-4147-3
pp.227-236
Federated Conference on Computer Science and Information Systems (FedCSIS) <15, 2020, Online>
English
Conference Paper
Fraunhofer SCAI ()

Abstract
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.

: http://publica.fraunhofer.de/documents/N-639426.html