Efficient Computation of Detailed Source Descriptions for Knowledge Graphs

When querying a system that consists of several knowledge graphs, the system needs to decide which parts of the query can be answered from which knowledge graph. Most systems use simple source descriptions, however, more detailed source descriptions enable the system to find better plans.
The goal of this thesis is to provide a formal definition as well as an implementation for an algorithm that efficiently collects detailed source descriptions for knowledge graphs.

Voraussetzungen

  • Immatrikulation an einer deutschen Universität
  • Gute Englischkenntnisse in Schrift und Wort
  • Gute Programmierkenntnisse in Python

Hilfreiche Lehrveranstaltungen

  • Datenstrukturen und Algorithmen
  • Knowledge Engineering und Semantic Web
  • Komplexität von Algorithmen

Abgedeckte Themen

  • Big Data
  • Knowledge Graphs
  • Query Processing
Feedback