0.25
0.5
0.75
1.25
1.5
1.75
2
Dynamic Planning for Link Discovery
Published on Jul 10, 2018580 Views
With the growth of the number and the size of RDF datasets comes an increasing need for scalable solutions to support the linking of resources. Most Link Discovery frameworks rely on complex link sp
Related categories
Chapter list
Dynamic Planning for Link Discovery00:00
Overview00:14
Motivation00:40
Why Link Discovery? - 100:45
What is Link Discovery? - 201:14
Declarative Link Discovery01:49
Why is it difficult?03:11
Our Contributions04:10
Approach04:58
Dynamic execution of LS05:03
Plannig for LD - Example LS06:04
Condor - 106:43
Condor - 206:50
Condor - 306:54
Condor - 406:56
Condor - 507:23
Condor - 607:45
Condor - 708:05
Condor - 808:35
Condor - 908:47
Condor - 1009:02
Condor - 1109:29
Dynamic execution of LS - 109:37
Dynamic execution of LS - 209:42
Dynamic execution of LS - 309:50
Dynamic execution of LS - 410:00
Dynamic execution of LS - 510:15
Condor - 1210:33
Condor - 1310:59
Condor - 1411:13
Condor - 1511:23
Condor - 1611:33
Condor - 1711:54
Evaluation12:02
Experiment set-up12:07
Experiment 1 - 113:07
Experiment 1 - 213:20
Experiment 2 - 114:00
Experiment 2 - 214:07
Experiment 3 - 115:06
Conclusions and Future Work - 116:25
Conclusions and Future Work - 216:30
Thank you! Questions?17:31