0.25
0.5
0.75
1.25
1.5
1.75
2
Querying Large Knowledge Graphs over Triple Pattern Fragments: An Empirical Study
Published on Nov 22, 20182224 Views
Triple Pattern Fragments (TPFs) are a novel interface for accessing data in knowledge graphs on the web. Up to this date, work on performance evaluation and optimization has focused mainly on SPARQL q
Related categories
Chapter list
Querying Large Knowledge Graphs over Triple Pattern Fragments: An Empirical Study00:00
Motivation - 100:11
Motivation - 200:14
Approach and experimental setup01:16
Motivation01:16
The TPF Profiler Resource01:20
Sampling Component I - 101:47
Sampling Component I - 202:24
Sampling Component I - 302:43
Sampling Component II02:50
Evaluation Component03:08
Experimental Setup - Controlled Environment03:48
Experimental Setup - Real-World Environment04:20
Experimental Setup - Configuration04:57
Experimental results05:57
Empirical Results I06:01
Empirical Results II - 107:09
Empirical Results II - 207:46
Empirical Results III08:44
Empirical Results IV09:35
Empirical Results V11:07
Summary – Major Takeaways12:12
Conclusion – Resource Application13:34