0.25
0.5
0.75
1.25
1.5
1.75
2
Substring Filtering for Low-Cost Linked Data Interfaces
Published on Nov 10, 20151681 Views
Recently, Triple Pattern Fragments (tpfs) were introduced as a low-cost server-side interface when high numbers of clients need to evaluate sparql queries. Scalability is achieved by moving part of
Related categories
Chapter list
Substring Filtering for Low -Cost Linked Data interfaces00:00
Introduction00:20
Substring Filtering for Low -Cost Linked Data interfaces01:13
Extending Triple Pattern Fragments01:34
Linked Data Fragments - 101:39
Linked Data Fragments - 201:58
Triple Pattern Fragments - 102:09
Triple Pattern Fragments - 202:11
Triple Pattern Fragments - 302:15
Problem statement03:00
Triple Pattern Fragments with Substring filtering - 104:15
Triple Pattern Fragments with Substring filtering - 204:22
Triple Pattern Fragments with Substring filtering - 304:26
Server-side substring filtering05:00
Substring matching with BWT and FM -index05:55
HDT06:04
Burrows-Wheeler Transform - 106:40
Burrows-Wheeler Transform - 207:07
Burrows-Wheeler Transform - 307:18
Burrows-Wheeler Transform - 407:36
Burrows-Wheeler Transform - 507:41
Burrows-Wheeler Transform - 607:42
FM -Index07:46
FM -Index algorithm - 108:09
FM -Index algorithm - 208:18
FM -Index algorithm - 308:32
Apply this to list of strings - 109:01
Apply this to list of strings - 209:28
Apply this to list of strings - 309:36
Apply this to list of strings - 409:44
Apply this to list of strings - 510:02
Apply this to list of strings - 610:11
Apply this to list of strings - 710:32
Case-insensitive FM -index11:00
Results & Conclusion11:54
Results - 112:01
Results - 212:48
Results - 314:04
Conclusion14:41
Future Work15:18