Performance evaluation of the variety of Linked Data Interfaces
Keywords: Linked Data, RDF, Webdevelopment, SPARQL, decentralization, Querying
Promotors: Ruben Verborgh, Ruben Taelman
Students: max 1
Linked Data can be published on the Web in a variety of different ways, which will then lead to different approaches for querying over them.
Some approaches will achieve fast query execution, while others may be better suited for lowering server effort.
In the recent years, several new solutions have been introduced for publishing Linked Data, each providing their own trade-offs.
So far, these approaches have only very limited proof for their performance,
and they have not yet been compared in full to other approaches.
In this thesis, we will do an in-depth comparison of different Linked Data publishing approaches.
Concretely, the student will do the following:
- Perform an extensive performance evaluation of the different approaches using a server and multi-client setup.