Internal Data Strcture for Storing Graph

36 views
Skip to first unread message

Alireza Rezaei Mahdiraji

unread,
Apr 23, 2014, 8:45:33 AM4/23/14
to ne...@googlegroups.com

Hi All,

I am looking to find out how Neo4j internally stores graphs, e.g., does it use an adjacency list or matrix or ...?

Is there any benchmark which shows what data structure is the best for graphs?

Thanks,
Best,
Alireza

Michael Hunger

unread,
May 9, 2014, 9:05:34 PM5/9/14
to ne...@googlegroups.com
You find some information on neo4j.org/develop/internals e.g. the blog series from Chris Gioran.

It uses adjacency lists of relationships per direction and type.

But you can also just look at the code.

Michael

--
You received this message because you are subscribed to the Google Groups "Neo4j" group.
To unsubscribe from this group and stop receiving emails from it, send an email to neo4j+un...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

Reply all
Reply to author
Forward
0 new messages