0.25
0.5
0.75
1.25
1.5
1.75
2
A Worst-Case Optimal Join Algorithm for SPARQL
Published on Dec 10, 201980 Views
Related categories
Chapter list
A Worst-Case Optimal Join Algorithm for SPARQL00:00
Outline00:10
Introduction00:12
Introduction00:16
Introduction00:17
Introduction00:31
Introduction00:33
Introduction00:37
Introduction00:38
How about using new techniques?00:53
Introduction00:58
Outline01:12
Preliminaries01:15
Preliminaries01:21
Preliminaries01:24
Preliminaries01:33
Preliminaries01:39
Preliminaries01:40
Preliminaries01:45
Preliminaries01:59
Preliminaries02:18
Preliminaries02:25
Preliminaries02:37
Preliminaries03:00
Preliminaries03:36
Preliminaries03:51
Improvement for RDF databases04:01
Outline04:11
SPARQL Example04:18
SPARQL Example04:30
SPARQL Example04:52
We adapted05:22
Leapfrog Join05:26
Leapfrog Join05:31
Leapfrog Join05:42
Leapfrog Join05:53
Leapfrog Join05:57
Leapfrog Join05:59
Leapfrog Join06:23
Leapfrog Join06:34
Leapfrog Join06:39
Leapfrog Join06:44
Leapfrog Join06:50
Leapfrog Join06:56
Leapfrog Join07:01
Leapfrog Join07:06
Leapfrog Join07:16
Leapfrog Join07:45
Leapfrog Join08:14
Outline08:41
Implementation08:44
Indexes of an RDF Database09:02
Our Indexing Approach09:26
Our Indexing Approach09:55
Our Indexing Approach10:34
Implementation10:48
Real world data11:13
Outline11:17
Experiments11:19
Experiments11:30
Experiments11:50
Experiments12:09
Experiments12:21
Experiments12:25
Experiments12:47
Experiments13:01
Experiments13:12
Experiments13:17
Experiments13:30
Experiments13:46
Outline13:57
Conclusion14:00
Future Work14:26
Resources14:46
A Worst-Case Optimal Join Algorithm for SPARQL15:02