0.25
0.5
0.75
1.25
1.5
1.75
2
A Worst-Case Optimal Join Algorithm for SPARQL
Published on 2019-12-1082 Views
Related categories
Presentation
A Worst-Case Optimal Join Algorithm for SPARQL00:00
How about using new techniques?00:53
Introduction00:58
Preliminaries01:45
Improvement for RDF databases04:01
SPARQL Example04:52
We adapted05:22
Leapfrog Join07:45
Implementation08:44
Indexes of an RDF Database09:02
Our Indexing Approach10:34
Real world data11:13
Experiments13:01
Outline13:57
Conclusion14:00
Future Work14:26
Resources14:46