These slides represent the second of a five-part tutorial presentation given at the 22nd International World Wide Web Conference (WWW 2013). An awareness of foundations and theoretical properties of Linked Data queries is essential for understanding the possibilities and limitations of Linked Data query processing. Consequently, before focusing on systems-related topics in the remainder of the tutorial, this section provides an overview on the main results of theory research in the context of Linked Data queries. More precisely, it introduces semantics for SPARQL-based Linked Data queries and discuss characteristics of queries under these semantics.
URL: http://dsg.uwaterloo.ca/LDQTut2013/LDQTut2013_2.pdf
Keywords: Full-Web Semantics, SPARQL, Turing machine, Reachability-Based Query Semantics
Author: Hartig, Olaf
Date created: 2013-05-14 04:00:00.000
Language: http://id.loc.gov/vocabulary/iso639-2/eng
Time required: P20M
Educational use: professionalDevelopment
Educational audience: student
Interactivity type: expositive