0.25
0.5
0.75
1.25
1.5
1.75
2
HELIOS - Execution Optimization for Link Discovery
Published on Dec 19, 20142297 Views
Links between knowledge bases build the backbone of the Linked Data Web. In previous works, the combination of the results of time-efficient algorithms through set-theoretical operators has been shown
Related categories
Chapter list
HELIOS Execution Optimization For Link Discovery00:00
Why Link Discovery?00:18
Formal Denition - 100:53
Formal Denition - 201:19
Normal Form for Link Specications - 101:37
Normal Form for Link Specications - 202:00
Why is it dicult? - 103:19
Why is it dicult? - 203:48
Execution Optimization04:35
Rewriting - 105:29
Rewriting - 205:55
Rewriting - 307:24
Rewriting - 407:33
Rewriting - 507:47
Rewriting - 608:08
Rewriting - 708:56
Rewriting - 809:01
Rewriting - 909:14
Rewriting - 1009:28
Rewriting - 1109:37
Rewriting - 1210:09
Approach10:32
Plan Evaluation - 111:02
Plan Evaluation - 211:42
Plan Evaluation - 312:12
Plan Optimization - 112:32
Plan Optimization - 212:52
Plan Optimization - 312:53
Experimental Setup13:26
Runtime on Expert Specications -113:39
Runtime on Expert Specications -213:56
Runtime on LGD14:11
Conclusion and Future Work14:48
That's all Folks!15:13