What is the storage layer?

Hi, I have read the excellent e-book “Native Parallel Graphs” and need to understand the section “Compact Storage with Fast Access” a bit more. If we take a very simple example, of:

        Damien _posted_ Question_X

, where i have 2 nodes and 1 relationship. How/where is this stored? What does the actual stored data look like.

Chapter 6 is v illuminating in describing an alternative of KV, but KV store is immediately understandable too, in terms of what the data looks like on disk. Thanks!

Thanks for the question. We covered the architecture overview in a webinar. Here’s the link to the recording:

Hopefully, that’ll answer the question. If you have specific question, please post it here.