HiBISCuS: Hypergraph-Based Source Selection for SPARQL Endpoint Federation thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

HiBISCuS: Hypergraph-Based Source Selection for SPARQL Endpoint Federation

Published on Jul 30, 20142183 Views

Efficient federated query processing is of significant importance to tame the large amount of data available on the Web of Data. Previous works have focused on generating optimized query execution pla

Related categories

Chapter list

HiBISCuS: Hypergraph-Based Source Selection for SPARQL Endpoint Federation00:00
SPARQL Endpoint Federation00:15
SPARQL Endpoint Federation01:48
SPARQL Endpoint Federation01:57
Our Contribution02:06
Motivation02:27
Motivation02:31
Problem Statement07:04
HiBISCuS: SPARQL Quesry as Hypergraph08:05
HiBISCuS: Data Summaries10:10
HiBISCuS: Triple Pattern-wise Source Pruning11:18
HiBISCuS: Triple Pattern-wise Source Pruning14:24
Experimental Setup15:24
Experimental Setup15:27
Experimental Setup16:23
Index generation time and compression ratio16:37
Efficient source selection17:04
FedX Extension with HiBISCuS17:26
SPLENDID Extension with HiBISCuS17:53
DARQ Extension with HiBISCuS18:00
SPLENDID+HiBISCuS vs ANAPSID18:15
Conclusion and Future work18:40
Thank you!19:35