This is my first time posting in the forum and I might be posting in the wrong category. If that's the case, please let me know and I will make a new post.
I read in Chapter 6: Graph Database Internals in the Graph Databases O'Reilly book that Neo4j stores edges as doubly linked list. I am working on a research project to experiment with a different storage format, trying to see how will that impact performance. I am wondering if there are resources (talks, slides, articles, etc) that describe the main components to look for in the codebase that can help me accomplish the project.