0.25
0.5
0.75
1.25
1.5
1.75
2
Query Execution Optimization for Clients of Triple Pattern Fragments
Published on Jul 15, 20151785 Views
In order to reduce the server-side cost of publishing queryable Linked Data, Triple Pattern Fragments (tpf) were introduced as a simple interface to rdf triples. They allow for sparql query executio
Related categories
Chapter list
Query Execution Optimization for Clients of Triple Patterns Fragments00:00
Accessing linked data00:15
Outline01:18
Accessing Linked Data01:48
Linked Data access extremes01:50
Linked Data Fragments02:37
SPARQL endpoint03:19
Triple Pattern Fragments - 103:41
Triple Pattern Fragments - 204:27
Problem statement05:16
Greedy algorithm05:46
Optimized algorithm - 107:23
Improved join tree07:51
Optimized algorithm - 208:09
Extended example - 108:55
Extended example - 209:30
First iteration10:12
Further iterations10:47
Updating pattern roles11:06
Optimizing local joins12:43
Local joining13:07
Join tree step13:44
Minimizing joins14:28
Bringing it all together15:32
Summary15:45
Test setup16:33
Results17:04
Conclusion18:14
Questions?19:16