0.25
0.5
0.75
1.25
1.5
1.75
2
Join Ordering of SPARQL Property Path Queries
Published on Jun 13, 20233 Views
Chapter list
Join Ordering of SPARQL Property Path Queries00:00
SPARQL Property Path Queries - 100:16
SPARQL Property Path Queries - 200:50
SPARQL Property Path Queries - 301:02
SPARQL Property Path Queries - 401:09
Just changing the join order improves performance01:25
Cost-based query optimizers select the join order that minimizes intermediate results01:55
The Join Ordering Problem in presence of Property Paths02:31
Approach02:40
Why are intermediate results not relevant to compare the two join orders ?02:41
Computing a reachability pattern following the SPARQL specification03:32
Key Idea : Relaxation04:19
Forward & backward relaxations04:33
Backward Relaxation Example05:20
Forward Relaxation Example05:54
Relaxation allows to reuse existing Cost-model06:34
How to estimate the cardinalities needed by the cost function?07:25
How random walks estimate cardinalities without property paths?08:00
How random walks estimate cardinalities without property paths?08:41
How to use Random Walks on Property Paths?08:49
Estimating the cardinality of Q knowing the diameter d09:17
Estimating the cardinality of Q without knowing the diameter d - 109:37
Estimating the cardinality of Q without knowing the diameter d - 209:50
Estimating the cardinality of Q without knowing the diameter d - 310:12
Estimating the cardinality of Q without knowing the diameter d - 410:21
Estimating the cardinality of Q without knowing the diameter d - 510:22
Estimating the cardinality of Q without knowing the diameter d - 610:22
Query Optimizer for SPARQL Property Path Queries10:26
Experimental Study10:36
Experimental Setup10:51
Comparison with Blazegraph - 111:28
Comparison with Blazegraph - 212:05
Comparison with Blazegraph - 312:22
Comparison with Blazegraph - 312:29
Comparison with Virtuoso12:43
Conclusion13:53
Perspectives14:18
Join Ordering of SPARQL Property Path Queries15:18