0.25
0.5
0.75
1.25
1.5
1.75
2
A Compact In-Memory Dictionary for RDF data
Published on Jul 15, 20151589 Views
While almost all dictionary compression techniques focus on static RDF data, we present a compact in-memory RDF dictionary for dynamic and streaming data. To do so, we analysed the structure of ter
Related categories
Chapter list
RDFVault: A Compact In-Memory Dictionary For RDF data00:00
Dictionary00:10
D of HDT01:26
Dictionary Encoding02:00
The Goal03:12
Method03:24
Common Prefixes Memory Consumption03:57
Trie Properties04:55
Trie Example05:55
Compact Trie09:12
Compact Trie Memory Efficiency09:31
Adaptive Radix Tree (ART)09:55
Adaptive Radix tree Memory Efficiency10:14
Burst Trie & HAT10:30
List Trie11:37
Children distribution - 113:10
Children distribution - 213:50
Trie used in RDFVault14:27
Preserving Pointers15:06
Memory Efficiency15:26
Memory Efficiency16:24
Performance16:41
Move-to-front Effectiveness18:04
Conclusion18:40