video thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

SAKey: Scalable Almost Key discovery in RDF data

Published on 2014-12-191915 Views

Exploiting identity links among RDF resources allows applications to efficiently integrate data. Keys can be very useful to discover these identity links. A set of properties is considered as a key wh

Related categories

Presentation

SAKey: Scalable Almost Key discovery in RDF data00:00
Linked Open Data Cloud (LOD)00:13
Data Linking00:48
Keys - 101:30
Keys - 201:37
Keys - 301:50
Keys - 402:09
Keys - 502:17
Keys - 602:26
OWL2 Key - 102:37
OWL2 Key - 202:59
OWL2 Key - 303:00
Key Discovery -­‐ Related Work - 103:15
Key Discovery -­‐ Related Work - 203:26
Problem statement - 103:46
Problem statement - 204:10
Problem statement - 304:28
Problem statement - 404:41
SAKey: Scalable Almost Key discovery - 104:48
SAKey: Scalable Almost Key discovery - 205:00
SAKey: Scalable Almost Key discovery - 305:10
SAKey: Scalable Almost Key discovery - 405:31
SAKey: Scalable Almost Key discovery - 505:44
Almost key discovery strategy - 106:05
Almost key discovery strategy - 206:48
Almost key discovery strategy - 307:00
Almost key discovery strategy - 407:13
Almost key discovery strategy - 507:36
Almost key discovery strategy - 607:57
SAKey -­‐ General Architecture - 108:11
SAKey -­‐ General Architecture - 208:29
n-­‐non key discovery: Initial Map09:00
n-­‐non key discovery: Data filtering09:34
n-­‐non key discovery: Final Map10:29
SAKey -­‐ General Architecture - 310:45
n-­‐non key discovery: Potential n-­‐non keys10:58
SAKey -­‐ General Architecture - 411:24
n-­‐non key discovery - 111:27
n-­‐non key discovery - 211:50
n-­‐non key discovery - 311:53
n-­‐non key discovery - 412:16
n-­‐non key discovery: Pruning strategies12:31
SAKey -­‐ General Architecture - 512:43
SAKey: Efficient key derivation12:46
Experiments13:20
Data Linking using almost keys - 113:50
Data Linking using almost keys - 214:04
Data Linking using almost keys - 314:08
Data Linking using almost keys - 414:14
Data Linking using almost keys - 514:24
Scalability: KD2R[PSS13] vs. SAKey15:00
Scalability: KD2R vs. SAKey - 115:16
Scalability: KD2R vs. SAKey - 215:18
KD2R vs. SAKey -­‐ Non key discovery15:24
KD2R vs. SAKey -­‐ Key derivation15:39
Scalability of SAKey - 115:52
Scalability of SAKey - 216:06
Scalability of SAKey - 316:07
Scalability of SAKey -­‐ Data filtering - 116:10
Scalability of SAKey -­‐ Data filtering - 216:31
Scalability of SAKey -­‐ Prunings - 116:32
Scalability of SAKey -­‐ Prunings - 216:40
Conclusion and Future works16:57