0.25
0.5
0.75
1.25
1.5
1.75
2
Cooperative Techniques for SPARQL Query Relaxation in RDF Databases
Published on Jul 15, 20151764 Views
This paper addresses the problem of failing RDF queries. Query relaxation is one of the cooperative techniques that allows providing users with alternative answers instead of an empty result. While
Related categories
Chapter list
Cooperative Techniques for SPARQL Query Relaxation in RDF Databases00:00
Motivation - 100:19
Motivation - 201:25
Related Work - 101:38
Related Work - 203:44
Minimal Failing Subquery (MFS) - 104:03
Minimal Failing Subquery (MFS) - 205:05
MaXimal Succeeding Subquery (XSS) - 105:08
MaXimal Succeeding Subquery (XSS) - 205:49
Outline - 105:57
LBA Approach: 1) Finding an MFS - 106:14
LBA Approach: 1) Finding an MFS - 206:52
LBA Approach: 1) Finding an MFS - 307:04
LBA Approach: 1) Finding an MFS - 407:28
LBA Approach: 1) Finding an MFS - 507:39
LBA Approach: 2) Computing Potential XSSs - 107:54
LBA Approach: 2) Computing Potential XSSs - 208:48
LBA Approach: 2) Computing Potential XSSs - 309:17
LBA Approach: 2) Computing Potential XSSs - 409:57
LBA Approach: 2) Computing Potential XSSs - 510:08
LBA Approach: 2) Computing Potential XSSs - 610:29
LBA Approach: 2) Computing Potential XSSs - 710:38
Outline - 211:01
MBA Approach: Overview11:03
MBA Approach: Relaxed Matrix Computation - 112:26
MBA Approach: Relaxed Matrix Computation - 213:09
MBA Approach: Relaxed Matrix Computation - 313:25
MBA Approach: Relaxed Matrix Computation - 413:32
MBA Approach: Relaxed Matrix Computation - 513:42
MBA Approach: Relaxed Matrix Computation - 613:51
MBA Approach: Relaxed Matrix Computation - 714:05
MBA Approach: MFSs and XSSs computation14:23
Outline - 315:29
Experimental Setup15:31
Experiments: XSS and MFS Computation Time - 116:22
Experiments: XSS and MFS Computation Time - 216:44
Experiments: XSS and MFS Computation Time - 317:01
Experiments: Performance as the number of TP scales17:43
Outline - 418:13
Conclusion and Perspectives18:15