A Formal Framework for Comparing Linked Data Fragments thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

A Formal Framework for Comparing Linked Data Fragments

Published on Nov 28, 2017866 Views

The Linked Data Fragment (LDF) framework has been proposed as a uniform view to explore the trade-offs of consuming Linked Data when servers provide (possibly many) different interfaces to access thei

Related categories

Chapter list

Linked Data Fragments World00:00
Is this really a line?01:20
Is this really a line? - 101:59
A more fundamental understanding of LDF interfaces02:48
A Formal Framework to Compare Linked Data Fragments03:36
Main contributions03:49
LDFM04:19
(LC LS )-LDFM06:12
({⨝},TPF)-LDFM06:54
(Ø,brTPF)-LDFM07:37
What are the queries computed by (LC LS ) LDFMs?08:33
Client Languages, server languages09:29
Client Languages, server languages - 109:53
Client Languages, server languages - 210:44
Client Languages, server languages - 311:13
Fine-Grained Complexity Analysis11:20
# requests comm. bandwidth11:26
# requests comm. bandwidth - 112:18
# requests comm. bandwidth - 213:00
A theory for comparing different access protocols for SemWeb data14:04
A theory for comparing different access protocols for SemWeb data - 114:31
A Formal Framework to Compare Linked Data Fragments15:09