en-es
en-fr
en-sl
en
0.25
0.5
0.75
1.25
1.5
1.75
2
Planning Ahead: Stream-Driven Linked-Data Access under Update-Budget Constraints
Published on Nov 10, 20161386 Views
Data stream applications are becoming increasingly popular on the web. In these applications, one query pattern is especially prominent: a join between a continuous data stream and some background dat
Related categories
Chapter list
University of Zurich00:00
Planning Ahead00:06
How can we efficiently access SPARQL endpoints in RDF Stream Processing?00:24
Finding Trendy Hashtags00:52
Accessing Background Knowledge is Costly03:06
How can we allocate budget efficiently? - 105:09
How can we allocate budget efficiently? - 206:01
What is the optimisation goal?07:41
Service Clause PS - BGP - 108:18
Service Clause PS - BGP - 208:59
Service Clause PS - BGP - 309:05
Service Clause PS - BGP - 409:17
Service Clause PS - Agg - 110:23
Service Clause PS - Agg - 211:07
Service Clause PS - Agg - 311:30
Service Clause PS - Agg - 412:02
SBM: Selectivity Based Maintenance12:57
IBM: Impact Based Maintenance - 113:14
IBM: Impact Based Maintenance - 213:23
FBA: Flexible Budget Allocation - 114:19
FBA: Flexible Budget Allocation - 214:37
FBA: Flexible Budget Allocation - 314:45
FBA: Flexible Budget Allocation - 415:02
How can we allocate the budget better?15:25
Experiment setup15:49
Increasing Budget - 116:00
Increasing Graph Density16:40
Increasing Budget - 217:05
Increasing Budget - 317:12
Increasing Budget - 417:21
Summary17:38
Questions17:53