These slides represent the fifth of a five-part tutorial presentation given at the 22nd International World Wide Web Conference (WWW 2013). This final part of the tutorial discusses query planning for Linked Data queries and reviews existing work that aims to address the problems in this phase of query processing. Query planning comprises the generation of candidate execution plans and the selection of one of these plans for the actual execution. While such a selection usually aims for minimizing the overall executing time, possible optimization criteria in the context of Linked Data queries are more diverse and include minimizing response time, minimizing network traffic, or maximizing the degree of result completeness.
URL: http://dsg.uwaterloo.ca/LDQTut2013/LDQTut2013_5.pdf
Keywords: Heuristics-Based Plan Selection, Link Traversal Based Query Execution (LTBQE), Triple Frequency-Inverse Source Frequency (TF–ISF), Source Ranking
Author: Hartig, Olaf
Date created: 2013-05-14 04:00:00.000
Language: http://id.loc.gov/vocabulary/iso639-2/eng
Time required: P30M
Educational use: professionalDevelopment
Educational audience: student
Interactivity type: expositive