Many thanks for the pointer.
It will take me time to understand the paper in depth, but some questions seem to rise such as:
Storing Identififiers vs. strings
What if the graph database is used to store identifiers to strings rather than strings – such as to establish a multi-lingual structure – would this significantly affect the behavior – since no prefixes string structures would be given.
cost of traversal
GIven, what seems to be, dictionary based on subject-based encoding what is the lookup cost from a object node to a linked subject node.
And, similarly, what if a graph is traversed from object to subject – would this become more expensive?
p.s. i guess there are certain access patterns that are more prevalent with RDF based data – such as subject → predicate → object, or perhaps predicate → subject → object – which are optimized … do i understand this correctly?