0.25
0.5
0.75
1.25
1.5
1.75
2
Reasoning and Querying Web-scale Open Data based on DL-LiteA in a Divide-and-Conquer Way
Published on Nov 27, 201984 Views
Related categories
Chapter list
Reasoning and Querying Web-scale Open Data based on DL-LiteA in a Divide-and-Conquer Way00:00
Introduction00:09
Introduction—Discussed problem00:10
Introduction—Statistic of the BTC 2012 datasets00:56
Introduction—DL-LiteA01:27
Introduction—Our Proposal and the Bottleneck02:11
Introduction—Our Solution - 102:55
Introduction—Our Solution - 204:37
Introduction—Our Solution - 305:15
D&C: DL-LiteA KB Partition05:37
D&C: Conjunctive query partition and evaluation06:34
D&C: Optimization of evaluating query partitions over KB partitions07:13
Experiments:07:28
Experiments—Datasets and Tools07:53
Experiments—KB Construction and Partition08:27
Experiments—Satisfiability Checking08:51
Experiments—Query Answering10:02
Experiments—Simple-query answering10:40
Experiments—Non-simple-query answering - 111:16
Experiments—Non-simple-query answering - 212:04
Experiments—Non-simple-query answering - 312:24
Experiments—Non-simple-query answering - 412:43
Experiments—Comparison with related systems - 113:07
Experiments—Comparison with related systems - 213:36
Experiments—Comparison with related systems - 314:01
Experiments—Comparison with related systems - 414:33
Comparison with related works - 114:49
Comparison with related works - 214:55
Conclusion and Future Work15:35
Conclusion15:44
Future Work16:17