A slightly more complex version of the graph data-storage architecture is the semantic graph, and it looks somewhat like that:
As you might have noticed, this schema is based on the traditional graph design but it adds a little extra something to the mix – a type.
In the basic semantic graph design, each entity gets a type, and by that, some added meaning. Now, the little schema doesn’t just represent two connected nodes, but it represents two people, who also happen to be friends.
This type of architecture is very concise and efficient as it conveys a significant amount of extra meaning with just a single extra tweak. Making it a popular choice for describing more complex interconnected entities, such as, you guessed it, social networks.
However, since real semantics exclude the usage of language, this type of architecture is actually not semantic at all.