Col-Graph: Towards Writable and Scalable Linked Open Data thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Col-Graph: Towards Writable and Scalable Linked Open Data

Published on Dec 19, 20141745 Views

Linked Open Data faces severe issues of scalability, availability and data quality. These issues are observed by data consumers performing federated queries; SPARQL endpoints do not respond and res

Related categories

Chapter list

Col-Graph: Towards Writable and Scalable Linked Open Data00:00
LOD Quality Issues00:00
Use Case - 100:13
Use Case - 200:36
Use Case - 300:47
Use Case - 401:07
Use Case - 501:29
We Need Writing - 101:34
We Need Writing - 201:50
Related Works (1)02:03
Related Works (2)03:26
Our Contributions04:29
Example - 104:57
Example - 205:03
Example - 306:54
Example - 407:43
Fragments07:58
Fragment Consistency08:41
Example 2 - 109:13
Example 2 - 209:42
Synchronization Protocol10:02
Applying Protocol10:30
Experimentations11:02
Time11:29
Linear in number of updated triples. Faster than re-evaluation up to 30% of updated triples11:49
Annotation Size12:11
Annotations represent 10% overhead even on extreme cases.12:49
Social Topologies13:27
Few triples hit high annotation values14:02
Conclusions14:26
Perspectives14:41
Thank You15:01