| I. Papadakis, M. Stefanidakis, Ph. Mylonas, B. Endres Niggemeyer, S. Kazanas |
| Top-K Shortest Paths in Large Typed RDF Datasets Challenge |
| Semantic Web Challenges, Vol. 641, Third SemWebEval Challenge at ESWC 2016, H. Sack, S. Dietze, A. Tordai, C. Lange (eds.), Heraklion, Crete, Greece, pp. 191-199 |
|
ABSTRACT
|
| Perhaps the most widely appreciated linked data principle is the one that instructs linked data providers to provide useful information using the standards (i.e., RDF and SPARQL). Such information corresponds to patterns expressed as SPARQL queries that are matched against the RDF graph. Until recently, it was not possible to create a pattern without specifying the exact path that would match against the underlying graph. The advent of the SPARQL 1.1 Recommendation introduced property paths as a new graph matching paradigm that allows the employment of Kleene star * (and its variant Kleene plus +) unary operators to build SPARQL queries that are agnostic of the underlying RDF graph structure. In this paper, we present the Top-k Shortest Paths in large typed RDF Datasets Challenge the highlights the key aspects of property path queries that employ the Kleene star operator.
|
| 29 May , 2016 |
| I. Papadakis, M. Stefanidakis, Ph. Mylonas, B. Endres Niggemeyer, S. Kazanas, "Top-K Shortest Paths in Large Typed RDF Datasets Challenge", Semantic Web Challenges, Vol. 641, Third SemWebEval Challenge at ESWC 2016, H. Sack, S. Dietze, A. Tordai, C. Lange (eds.), Heraklion, Crete, Greece, pp. 191-199 |
[  PDF] [
BibTex] [
Print] [
 Back] |
