Research & Innovation

Labels in the Web of Data are the key element for humans to access the data. In the following, we analyze seven diverse datasets, from the web of data, a collaborative knowledge base, open governmental and GLAM data. We gain an insight into the current state of labels and multilinguality on the web of data.

In today’s age of (Industrial) Internet of Things, large amounts of data are generated in public and industrial settings every second. For enabling data analytics and aggregation, many companies currently focus on the approach of data lakes.

A known problem for proponents of Entity Linking in Cultural Heritage collections is the poor representation of entities in popular knowledge bases such as DBpedia. This is largely due to the niche nature of the entities contained in these collections.

The most common format to store and provide technical documentation is PDF. However, due to the un- structured nature of the format these documents are often excluded from a granular semantic access.

This paper describes an OWL ontology that is a Universal Moral Grammar (UMG). UMG has been hypothesized by students of Chomsky to play the same role in human ethics as Universal Grammar (UG) does in Linguistics. I.e., the UMG describes an innate genetic phenotype of moral reasoning just as UG describes the Language Faculty.

rdf Stream Processing (rsp) is a rapidly evolving area of research that focuses on extensions of the Semantic Web in order to model and process Web data streams.

Rigorous evaluations and analyses of evaluation results are key towards improving Named Entity Linking systems. Nevertheless, most current evaluation tools are focused on benchmarking and comparative evaluations.

Energy from Waste (EfW) projects require complex value chains to operate effectively. To identify business partners, plant operators need to network with organisations whose strategic objectives are aligned with their own. Supplier organisations need to work out where they fit in the value chain.

While graph data on the Web and represented in RDF is growing, SPARQL, as the standard query language for RDF still remains largely unusable for the most typical graph query task: finding paths between selected nodes through the graph. Property Paths, as introduced in SPARQL1.1 turn out to be unfit for this task, as they can only be used for testing path existence and not even allow to count the number of paths between nodes. While such a feature has been shown to theoretically highly intractable, particularly in graphs with a high degree of cyclicity, practical use cases still demand a solution. A common restriction in fact is not to ask for all, but only the $k$-shortest paths between two nodes, in order to obtain at least the most important of potentially infeasibly many possible paths. In this paper, we extend SPARQL 1.1 property paths in a manner that allows to compute and return the $k$ shortest paths matching a property path expression between two nodes.

We present an algorithm and implementation and demonstrate in our evaluation that a realtively straightforward solution works (in fact, more efficiently than other, tailored solutions in the literature) in practical use cases.

Join operators are particularly important in SPARQL query engines that collect RDF data using Web access interfaces. State-of-the-art SPARQL query engines rely on binary join operators tailored for merging results from SPARQL queries over Web access interfaces.
However, in queries with a large number of triple patterns, binary joins constitute a significant burden on the query performance.