0.25
0.5
0.75
1.25
1.5
1.75
2
HDTQ: Managing RDF Datasets in Compressed Space
Published on Jul 10, 2018616 Views
HDT (Header-Dictionary-Triples) is a well-known compressed representation of RDF data that supports retrieval features without prior decompression. Yet, RDF datasets often contain additional graph inf
Related categories
Chapter list
HDTQ: Managing RDF Datasets in Compressed Space00:00
HDT00:10
rdfhdt.org community01:56
Application Examples02:14
Application Examples03:38
A recurrent question04:07
HDT (Header-Dictionary-Triples) Overview04:39
Dictionary+Triples partition - 105:04
Dictionary+Triples partition - 205:20
Dictionary05:52
Bitmap Triples Encoding06:41
The magic of Bits: Bit Sequence Coding with Succinct Data Structures09:17
Bitmap Triples Encoding - 110:16
Bitmap Triples Encoding - 210:55
Additional Predicate and Object Indexes11:11
HDTQ: Adding Graph Information to HDT - 111:48
HDTQ: Adding Graph Information to HDT - 211:54
HDTQ: Adding Graph Information to HDT - 312:50
HDTQ: Adding Graph Information to HDT - 413:32
Search on HDTQ - 114:32
Search on HDTQ - 216:06
Search on HDTQ - 317:04
Search on HDTQ - 418:50
Evaluation. Datasets19:20
Evaluation. Systems20:24
Evaluation. Space Requirements21:21
Evaluation. Indexing Times22:49
Evaluation. Query performance - 123:23
Evaluation. Query performance - 224:25
Conclusions25:13
Future work25:53
Thank you!26:55