我要吃瓜

Citation

Scheglmann S & Scherp A (2014) Will linked data benefit from inverse link traversal?. In: Bizer C, Heath T, Auer S & Berners-Lee T (eds.) Proceedings of the Workshop on Linked Data on the Web co-located with the 23rd International World Wide Web Conference (WWW 2014), volume 1184. CEUR Workshop Proceedings, 1184. LDOW 2014: Linked Data on the Web, Seoul, Korea, 08.04.2014-08.04.2014. Aachen, Germany: CEUR Workshop Proceedings. http://ceur-ws.org/Vol-1184/

Abstract
Query execution using link-traversal is a promising approach for retrieving and accessing data on the web. However, this approach finds its limitation when it comes to query patterns such as ?s rdf:type ex:Employee, where one does not know the subject URI. Such queries are quite useful for different application needs. In this paper, we conduct an empirical analysis on the use of such patterns in SPARQL query logs. We present different solution approaches to extend the current Linked Open Data principles with the ability for inverse link traversal. We discuss the advantages and disadvantages of the different approaches.

Keywords
Querying of Linked Open Data; Link Traversal;

Journal
CEUR Workshop Proceedings: Volume 1184

• Scheglmann-Scherp 2014