0.25
0.5
0.75
1.25
1.5
1.75
2
Optimising Linked Data Queries in the Presence of Co-reference
Published on Jul 30, 20142200 Views
Due to the distributed nature of Linked Data, many resources are referred to by more than one URI. This phenomenon, known as co-reference, increases the probability of leaving out implicit semanticall
Related categories
Chapter list
Optimising Linked Data Queries in the Presence of Co-reference00:00
Co-reference in Linked Data00:12
Why to include co-reference01:15
Challenges02:47
Contributions04:08
Virtual Graph - 105:39
Virtual Graph - 206:25
Ψ: Parallel Sub-Query Identification - 107:08
Ψ: Parallel Sub-Query Identification - 208:29
Ψ: Parallel Sub-Query Identification - 309:17
Ψ: Parallel Sub-Query Identification - 409:46
Overview of LHD-d11:01
Evaluation settings12:49
Evaluation of Ψ (no co-ref) - 113:28
Evaluation of Ψ (no co-ref) - 214:18
Evaluation of Virtual Graph15:00
Impact of co-reference15:56
Evaluation of Virtual Graph16:47